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!)
A006159 a(n)=a(a(n-4))+a(n-a(n-4)).
(Formerly M0454)
0

%I M0454

%S 1,1,1,1,2,3,4,5,5,5,5,6,7,7,7,8,9,9,10,11,11,12,12,12,12,13,13,14,15,

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

%U 27,27,28,29

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

%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

%O 1,5

%A _N. J. A. Sloane_.

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 August 12 04:52 EDT 2022. Contains 356067 sequences. (Running on oeis4.)