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!)
A006162 a(n)=a(a(n-1)-2)+a(n+2-a(n-1)).
(Formerly M0450)
0

%I M0450 #8 Mar 30 2012 16:44:55

%S 1,1,2,3,4,4,5,6,7,8,8,8,9,10,11,12,13,13,14,14,15,16,17,18,19,20,20,

%T 21,22,22,22,22,23,24,25,26,27,28,29,29,30,31,32,32,33,33,34,34,35,36,

%U 37,38,39,40,41

%N a(n)=a(a(n-1)-2)+a(n+2-a(n-1)).

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

%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 April 19 18:05 EDT 2024. Contains 371798 sequences. (Running on oeis4.)