|
|
A005229
|
|
a(1) = a(2) = 1; for n > 2, a(n) = a(a(n-2)) + a(n - a(n-2)).
(Formerly M0441)
|
|
39
|
|
|
1, 1, 2, 3, 3, 4, 5, 6, 6, 7, 7, 8, 9, 10, 10, 11, 12, 12, 13, 14, 15, 16, 16, 17, 17, 18, 19, 19, 20, 20, 21, 22, 23, 24, 24, 25, 26, 26, 27, 28, 29, 29, 30, 30, 30, 31, 32, 33, 34, 35, 36, 36, 37, 37, 38, 39, 39, 40, 41, 42, 43, 43, 44, 45, 45, 45, 46
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
By induction a(n) <= n, but an exact rate of growth is not known.
|
|
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).
|
|
LINKS
|
|
|
MAPLE
|
fi; end;
|
|
MATHEMATICA
|
a[1] = a[2] = 1; a[n_] := a[n] = a[a[n-2]] + a[n - a[n-2]]; Table[a[n], {n, 1, 100}] (* Jean-François Alcover, Sep 06 2013 *)
|
|
PROG
|
(PARI) a(n)=an[n]; an=vector(100, n, 1); for(n=3, 100, an[n]=a(a(n-2))+a(n-a(n-2)))
(Haskell)
import Data.Function (on)
a005229 n = a005229_list !! (n-1)
a005229_list = 1 : 1 : zipWith ((+) `on` a005229)
a005229_list (zipWith (-) [3..] a005229_list)
(Sage)
@CachedFunction
if (n<3): return 1
else: return a(a(n-2)) + a(n-a(n-2))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,nice,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
Typo in definition corrected by Nick Hobson, Feb 21 2007
|
|
STATUS
|
approved
|
|
|
|