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
33, 68, 88, 103, 138, 143, 173, 183, 198, 208, 243, 253, 278, 298, 308, 313, 348, 363, 373, 383, 403, 413, 418, 453, 468, 473, 488, 523, 528, 558, 563, 578, 583, 593, 608, 628, 638, 643, 658, 663, 668, 693, 698, 733, 748, 753, 758, 763, 768, 778, 803, 838 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
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.
REFERENCES
R. K. Guy, Unsolved Problems In Number Theory, section C20.
LINKS
CROSSREFS
Cf. A024702.
Sequence in context: A248038 A032661 A256029 * A256022 A044135 A044516
KEYWORD
nonn
AUTHOR
Jud McCranie, Jun 20 2000
STATUS
approved

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 June 25 03:51 EDT 2024. Contains 373694 sequences. (Running on oeis4.)