login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006163 a(n)=a(a(n-1)-3)+a(n+3-a(n-1)).
(Formerly M0460)
0

%I M0460

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

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

%U 38,39,40,41,42,43,44,45,46,46,47,47,48,48,49,50,51,52,52,53,54,55,56,57

%N a(n)=a(a(n-1)-3)+a(n+3-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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 19 09:35 EST 2020. Contains 331048 sequences. (Running on oeis4.)