login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A055078 Write n as a sum of terms of the form (p^2-1)/24 where p is a prime > 4; sequence gives those n which require at least 4 terms. 0

%I #7 Mar 30 2012 18:34:54

%S 33,68,88,103,138,143,173,183,198,208,243,253,278,298,308,313,348,363,

%T 373,383,403,413,418,453,468,473,488,523,528,558,563,578,583,593,608,

%U 628,638,643,658,663,668,693,698,733,748,753,758,763,768,778,803,838

%N Write n as a sum of terms of the form (p^2-1)/24 where p is a prime > 4; sequence gives those n which require at least 4 terms.

%C Chowla conjectures that all numbers are the sum of no more than four terms of the form (p^2-1)/24 where p is a prime > 4.

%D R. K. Guy, Unsolved Problems In Number Theory, section C20.

%Y Cf. A024702.

%K nonn

%O 1,1

%A _Jud McCranie_, Jun 20 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 15 15:19 EDT 2024. Contains 374333 sequences. (Running on oeis4.)