

A051070


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


5



1, 2, 1, 0, 2, 3, 0, 7, 8, 4, 63, 1, 316, 78, 16, 2048, 7652, 26627, 8, 24000, 232919, 1145406, 3498690007594650042368, 2058537, 58, 26, 27, 59, 9272780, 3, 69273668, 4870847, 2387010102192469724605148123694256128, 1, 1, 53, 43, 0, 4696, 173, 44583, 111111111111111111111111111111111111111111, 30402457, 668803781, 1134903170, 382443020332
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

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


LINKS

Table of n, a(n) for n=1..46.
N. J. A. Sloane, My favorite integer sequences, in Sequences and their Applications (Proceedings of SETA '98).


EXAMPLE

a(19) = 8 because A000019(19) = 8.
a(20) = 24000 because A000020(20) = 24000.


MAPLE

for m from 1 do
url:= sprintf("https://oeis.org/A%06d/b%06d.txt", m, m);
S:= URL:Get(url);
L:= StringTools[Split](S, "\n");
for t in L do
g:= sscanf(t, "%d %d");
if nops(g) = 2 and g[1] = m then
a[m]:= g[2];
break
fi;
od;
if not assigned(a[m]) then break fi;
od:
seq(a[i], i=1..m1); # Robert Israel, May 31 2015


CROSSREFS

See A091967, A107357, A102288 for other versions. See also A031214, A031135, A037181.
Sequence in context: A091967 A031135 A037181 * A104041 A104402 A261897
Adjacent sequences: A051067 A051068 A051069 * A051071 A051072 A051073


KEYWORD

easy,sign


AUTHOR

Robert G. Wilson v, Aug 23 2000


EXTENSIONS

Rechecked and 4 more terms added by N. J. A. Sloane, May 25 2005
a(43) is presently unknown, since A000043(43) is the exponent of the 43rd Mersenne prime. a(44) = 668803781.  N. J. A. Sloane, May 25 2005
a(36) and a(42) corrected and a(43) to a(46) added by Robert Israel, May 31 2015
Definition revised by N. J. A. Sloane, Nov 27 2016


STATUS

approved



