A034797 a(0) = 0; a(n+1) = a(n) + 2^a(n).
0, 1, 3, 11, 2059
Offset: 0
References
- J. H. Conway, On Numbers and Games, Academic Press.
Links
- N. J. A. Sloane, Table of n, a(n) for n = 0..5
- Wilhelm Ackermann, Die Widerspruchsfreiheit der allgemeinen Mengenlehre, Math. Ann. 114 (1939), no. 1, 305-315.
- David Applegate, Benoit Cloitre, Philippe Deléham and N. J. A. Sloane, Sloping binary numbers: a new sequence related to the binary numbers, J. Integer Seq. 8 (2005), no. 3, Article 05.3.6, 15 pp. Preprint versions: [pdf, ps].
- O. Kurganskyy and I. Potapov, Reachability problems for PAMs, arXiv preprint arXiv:1510.04121 [cs.NA], 2015.
- Richard Rado, Universal graphs and universal functions, Acta Arith. 9 (1964), 331-340.
- Claudia Spiro, How often is the number of divisors of n a divisor of n?, J. Number Theory 21 (1985), no. 1, 81-100.
- Wikipedia, Rado graph.
Programs
-
Mathematica
a=0;lst={a};Do[AppendTo[lst,a+=2^a],{n,0,4}];lst (* Vladimir Joseph Stephan Orlovsky, May 06 2010 *) NestList[#+2^#&,0,5] (* Harvey P. Dale, Mar 22 2020 *)
Comments