cp's OEIS Frontend

A033183(a(n)) = n and A033183(m) < n for m < a(n);

for n>1: a(n) = A044102(n-1).

a(A078135(n))=0; a(A078136(n))=1; a(A078137(n))>0;

Conjecture (lower bound): for all k exists b(k) such that a(n)>k for n>b(k); see b(0)=A078135(12)=23 and b(1)=A078136(15)=39. This is true - see comments by Hieronymus Fischer.

Also first difference of A001156 (number of partitions of n into squares). - Wouter Meeussen, Oct 22 2005

Comments from Hieronymus Fischer, Nov 11 2007 (Start): First statement of monotony: a(n+k^2)>=a(n) for all k>1. Proof: we restrict ourselves on a(n)>0 (the case a(n)=0 is trivial). Let T(i), 1<=i<=a(n), be the a(n) different sum expressions of squares >1 representing n. Then, adding k^2 to those expressions, we get a(n) sums of squares T(i)+k^2, obviously representing n+k^2, thus a(n+k^2) cannot be less than a(n).

Second statement of monotony: a(n+m)>=max(a(n),a(m)) for all m with a(m)>1. Proof: let T(i), 1<=i<=a(n), be the a(n) different sum expressions of squares >1 representing n; let S(i), 1<=i<=a(m), be the a(m) different sum expressions of squares >1 representing m. Then, adding those expressions, we get a(n) sums of squares T(i)+S(1), representing n+m, further we get a(m) sums T(1)+S(i), also representing n+m, thus a(n+m) cannot be less than the maximum of a(n) and a(m).

The author's conjecture holds true. Proof by induction: b(0) exists; if b(k) exists, then a(j)>k for all j>b(k). Setting m:=b(k)+1, we find that there are k+1 sums B(0,i) of squares >1, 1<=i<=k+1, with m=B(0,i). Further there are k+1 such sum expressions B(1,i), B(2,i) and B(3,i), 1<=i<=k+1, representing m+1, m+2 and m+3, respectively. For n>b(k) we have n=m+4*floor((n-m)/4)+(n-m) mod 4.

Thus n=m+r+s*2^2, where r=0,1,2 or 3. Hence n can be written B(r,i)+s*2^2 and there are k+1 such representations. Let q be the maximal number (to be squared) occurring as a term within those sum expressions B(r,i), 0<=r<=3,1<=i<=k+1. We select a number p>q and we set c:=b(k)+p^2. For n>c, we have the k+1 representations B(r(n),i)+s(n)*2^2.

Additionally, for n-p^2 (which is >b(k)) there are also k+1 representations B(r_p,i)+s_p*2^2, where r_p:=r(n-p^2), s_p:=s(n-p^2). Thus n can be written B(r(n),i)+s(n)*2^2, 1<=i<=k+1 and B(r_p,i)+s_p*2^2+p^2, 1<=i<=k+1.

By choice of p all these sum representations of n are different, which implies, that there are 2k+2 such representations. It follows a(n)>2k+2>k+1 for all n>c, which implies, that b(k+1) exists.

A more precise formulation of the author's conjecture is "b(k):=min( n | a(j)>k for all j>n) exists for all k>=0". (End)

A033183(n) <= a(n). [From Reinhard Zumkeller, Nov 07 2009]

Numbers such that A078134(n)=0.

"Numbers which cannot be written as sum of squares > 1" is equivalent to "Numbers which cannot be written as sum of squares of primes." Equivalently, numbers which can be written as the sum of nonzero squares can also be written as sum of the squares of primes." cf. A090677 = number of ways to partition n into sums of squares of primes. - Jonathan Vos Post, Sep 20 2006

The sequence is finite with a(12)=23 as last member. Proof: When k=a^2+b^2+..., k+4 = 2^2+a^2+b^2+... If k can be written as sum of the squares of primes, k+4 also has this property. As 24,25,26,27 have the property, by induction, all numbers > 23 can be written as sum of squares>1. - Fung Cheok Yin (cheokyin_restart(AT)yahoo.com.hk), Apr 07 2007

Also, numbers which cannot be written as sum of squares of 2 and 3 (see A078137 for the proof). Explicit representation as sum of squares of primes, or rather of squares of 2 and 3, for numbers m>23: we have m=c*2^2+d*3^2, where c:=(floor(m/4) - 2*(m mod 4))>=0, d:=m mod 4. For that, the finiteness of the sequence is proved constructively. - Hieronymus Fischer, Nov 11 2007

Also numbers n such that every integer partition of n contains a squarefree number. For example, 21 does not belong to the sequence because there are integer partitions of 21 containing no squarefree numbers, namely: (12,9), (9,8,4), (9,4,4,4). - Gus Wiseman, Dec 14 2018

Also, k such that Fibonacci(k) mod 27 = 0. - Mohammed Bouayoun (bouyao(AT)wanadoo.fr), Mar 18 2004

A033183(a(n)) = n+1. - Reinhard Zumkeller, Nov 07 2009

A122841(a(n)) > 1 for n > 0. - Reinhard Zumkeller, Nov 10 2013

Sum of the numbers from 4*(n-1) to 4*(n+1). - Bruno Berselli, Oct 25 2018

Number of partitions of n into parts 5 and 6. - Seiichi Manyama, Jun 14 2017