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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006160 a(n)=a(a(n-5))+a(n-a(n-5)).
(Formerly M0463)
0
1, 1, 1, 1, 1, 2, 3, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 9, 10, 10, 11, 12, 13, 14, 14, 14, 14, 14, 14, 14, 14, 15, 16, 16, 17, 18, 19, 20, 21, 21, 21, 21, 22, 23, 24, 24, 24, 24, 25, 26, 26, 26, 26, 27, 28, 28, 28, 29, 29, 29, 30, 30, 30, 31, 32, 32, 33, 34, 34, 34, 35, 35, 36, 36 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,6

REFERENCES

J. Arkin, D. C. Arney, L. S. Dewald and W. E. Ebel, Jr., Families of recursive sequences, J. Rec. Math., 22 (No. 22, 1990), 85-94.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

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

CROSSREFS

Sequence in context: A036055 A034151 A101272 * A071640 A102674 A097623

Adjacent sequences:  A006157 A006158 A006159 * A006161 A006162 A006163

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane.

EXTENSIONS

More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Mar 28 2003

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 November 22 18:55 EST 2019. Contains 329410 sequences. (Running on oeis4.)