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!)
A006161 a(n)=a(a(n-1)-1)+a(n+1-a(n-1)).
(Formerly M0440)
2

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

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

%T 18,19,20,21,22,23,24,24,25,25,26,26,26,27,28,29,29,29,30,31,32,33,34,

%U 35,36,36,37,38,38,39,40,40,41,41,42,43,44,45,45,45,45,45,46,46,47,48,49

%N a(n)=a(a(n-1)-1)+a(n+1-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,easy

%O 1,3

%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 April 23 05:37 EDT 2024. Contains 371906 sequences. (Running on oeis4.)