A055078 - OEIS

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

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.

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

Table of n, a(n) for n=1..52.

CROSSREFS

Cf. A024702.

Sequence in context: A248038 A032661 A256029 * A256022 A044135 A044516

Adjacent sequences: A055075 A055076 A055077 * A055079 A055080 A055081

KEYWORD

nonn

AUTHOR

Jud McCranie, Jun 20 2000

STATUS

approved