

A102288


a(n) = 1 + (the nth term in sequence A_n, ignoring the offset), or a(n) = 1 if A_n has fewer than n terms.


5



1, 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, 52, 44, 1, 4096, 174, 37339, 111111111111111111111111111111111111111112, 30402458, 413927967
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

a(n) = A091967(n) + 1, except when A_n has fewer than n terms, in which case a(n) = 1. Of course this means that a value a(n) = 1 could arise in two different ways, but it will be easy to decide which.  N. J. A. Sloane, Nov 27 2016
What is a(102288)?!
See A091967 and A051070 for much more about this type of 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


LINKS

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


EXAMPLE

a(53) = 1 since A000053 has only 29 terms.


CROSSREFS

a(n) = A091967(n) + 1. See also A051070, A107357 (the same but respecting the offset).
Sequence in context: A205838 A238583 A238556 * A081248 A214636 A129690
Adjacent sequences: A102285 A102286 A102287 * A102289 A102290 A102291


KEYWORD

sign,changed


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
Corrected and extended by Daniel Sterman, Nov 27 2016
Definition revised by N. J. A. Sloane, Nov 27 2016
a(1) fixed by Daniel Sterman, Nov 28 2016


STATUS

approved



