On sum of one prime, two squares of primes and powers of 2

In this paper, it is proved by a different method that every sufficiently large odd integer can be written as a sum of one prime, two squares of primes and 17 powers of 2, which improves the previous result k=31\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k=31$$\end{document}.