OFFSET
1,2
COMMENTS
Vardi gives several identities satisfied by A001463 and this sequence.
REFERENCES
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
D. Marcus and N. J. Fine, Solutions to Problem 5407, Amer. Math. Monthly 74 (1967), 740-743.
Simon Plouffe, Approximations de séries génératrices et quelques conjectures, Dissertation, Université du Québec à Montréal, 1992; arXiv:0911.4975 [math.NT], 2009.
Simon Plouffe, 1031 Generating Functions, Appendix to Thesis, Montreal, 1992
J. L. Rémy, Sur la suite autodécrite de Golomb, J. Number Theory, vol. 66 1997 pp. 1-28.
N. J. A. Sloane, Handwritten notes on Self-Generating Sequences, 1970 (note that A1148 has now become A005282)
I. Vardi, The error term in Golomb's sequence, J. Number Theory, 40 (1992), 1-11. (See also the Math. Review, 93d:11103)
FORMULA
a(n) is asymptotic to tau^(1-tau)*n^tau where tau is the golden ratio, tau=(1+sqrt(5))/2. More precisely, a(n)= tau^(1-tau)*n^tau + c*n^(1/tau)+0(n^(1/tau)) where c is a constant around 0.6. Is there any known value for c? - Benoit Cloitre, Oct 29 2002
MATHEMATICA
Accumulate[a[1]=1; a[n_]:=a[n]=1+a[n-a[a[n-1]]]; Table[a[n], {n, 84}]] (* Harvey P. Dale, Oct 20 2011, from Robert G. Wilson v's program in A001463 *)
PROG
(Haskell)
a001463 n = a001463_list !! (n-1)
a001463_list = scanl1 (+) a001462_list
-- Reinhard Zumkeller, Apr 28 2012
CROSSREFS
KEYWORD
nonn,easy,nice
AUTHOR
STATUS
approved