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”).

A006161
a(n)=a(a(n-1)-1)+a(n+1-a(n-1)).
(Formerly M0440)
2
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, 18, 19, 20, 21, 22, 23, 24, 24, 25, 25, 26, 26, 26, 27, 28, 29, 29, 29, 30, 31, 32, 33, 34, 35, 36, 36, 37, 38, 38, 39, 40, 40, 41, 41, 42, 43, 44, 45, 45, 45, 45, 45, 46, 46, 47, 48, 49
OFFSET
1,3
REFERENCES
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.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
CROSSREFS
Sequence in context: A074753 A013928 A172104 * A132351 A025556 A338006
KEYWORD
nonn,easy
AUTHOR
EXTENSIONS
More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Mar 28 2003
STATUS
approved