login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A068962 Number of successive terms of A028356 that add to n; or length of n-th term of A028355. 4
1, 1, 1, 1, 2, 3, 2, 4, 3, 4, 5, 5, 5, 5, 6, 7, 7, 7, 7, 8, 9, 8, 10, 9, 10, 11, 11, 11, 11, 12, 13, 13, 13, 13, 14, 15, 14, 16, 15, 16, 17, 17, 17, 17, 18, 19, 19, 19, 19, 20, 21, 20, 22, 21, 22, 23, 23, 23, 23, 24, 25, 25, 25, 25, 26, 27, 26, 28, 27, 28, 29, 29, 29, 29, 30, 31, 31 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

REFERENCES

Suggested by R. K. Guy, Mar 01, 2002.

LINKS

Seiichi Manyama, Table of n, a(n) for n = 1..10000

FORMULA

Each group of 15 terms is 6 more than the previous group.

CROSSREFS

Cf. A028355, A028356.

Sequence in context: A239328 A076753 A245134 * A036380 A241054 A257907

Adjacent sequences:  A068959 A068960 A068961 * A068963 A068964 A068965

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane, Apr 08 2002

EXTENSIONS

More terms from Jim McCann (jmccann(AT)umich.edu), Jul 16 2002

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 6 14:15 EST 2019. Contains 329806 sequences. (Running on oeis4.)