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!)
A006160 a(n)=a(a(n-5))+a(n-a(n-5)).
(Formerly M0463)
0

%I M0463

%S 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,

%T 14,14,14,14,15,16,16,17,18,19,20,21,21,21,21,22,23,24,24,24,24,25,26,

%U 26,26,26,27,28,28,28,29,29,29,30,30,30,31,32,32,33,34,34,34,35,35,36,36

%N a(n)=a(a(n-5))+a(n-a(n-5)).

%D 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.

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

%K nonn,easy

%O 1,6

%A _N. J. A. Sloane_.

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

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 30 09:38 EDT 2022. Contains 354920 sequences. (Running on oeis4.)