

A102288


a(n) = 1 + the nth term in sequence A_n, ignoring the offset.


5



2, 3, 2, 1, 3, 4, 1, 7, 7, 5, 45, 2, 181, 43, 17, 1097, 7653, 13782, 9, 24001, 119780, 458562, 152116956851941670913, 1054536, 52, 11, 28, 60, 4806079, 3, 35792569, 3010350, 2387010102192469724605148123694256129, 3, 1, 54, 44, 1, 4096, 174, 37339, 43
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


COMMENTS

What is a(102288)?
See A051070 for much more about this sequence.
The definition of this sequence is used in the traditional 'diagonal' proof that there are uncountably many integer sequences.  Simon Nickerson (simonn(AT)maths.bham.ac.uk), Jun 28 2005
The sequence is undefined from n=53 on, since A000053 has only 29 terms.  M. F. Hasler, Sep 22 2013


LINKS

Table of n, a(n) for n=1..42.


CROSSREFS

a(n) = A091967(n) + 1. See also A051070, A107354 (the same but respecting the offset).
Sequence in context: A139367 A117648 A037222 * A107357 A182457 A026105
Adjacent sequences: A102285 A102286 A102287 * A102289 A102290 A102291


KEYWORD

sign,fini


AUTHOR

Alexandre Wajnberg, Feb 19 2005


EXTENSIONS

Corrected and extended by N. J. A. Sloane, May 25 2005
Offset corrected by M. F. Hasler, Sep 22 2013


STATUS

approved



