login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

a(n)=a(a(n-1)-4)+a(n+4-a(n-1)).
(Formerly M0465)
0

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

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

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

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

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