|
%I #82 Jan 13 2023 18:58:02
%S 1,2,1,0,2,3,0,7,8,4,63,1,316,78,16,2048,7652,26627,8,24000,232919,
%T 1145406,3498690007594650042368,2058537,58,26,27,59,9272780,3,
%U 69273668,4870847,2387010102192469724605148123694256128,1,1,-53,43,0,-4696,173,44583,111111111111111111111111111111111111111111,30402457,668803781,1134903170,382443020332
%N a(n) is the n-th term in sequence A_n, respecting the offset, or a(n) = -1 if A_n has fewer than n terms.
%C a(58) = A000058(58) = 192523...920807 (58669977298272603 digits) is too large to include in the b-file. - _Pontus von Brömssen_, May 19 2022
%C Comment from _N. J. A. Sloane_, Dec 26 2022 (Start)
%C Note that a(n) = -1 can arise in two ways: either A_n has fewer than n terms, or A_n has at least n terms, but its n-th term is -1.
%C Here is a summary of the terms with n <= 80.
%C a(n) = -1 occurs just twice, for n = 53 and 54, in both cases because the relevant New York subway lines do not have enough stops.
%C a(1) though a(65) are known, although a(58) = = 192523...920807 has 58669977298272603 digits.
%C a(66) is the first unknown value.
%C Also unknown for n <= 80 are a(67), a(72), a(74), a(75), a(76), and a(77) (counts of numbers <= 2^n represented by various quadratic forms; some of these do not even have b-files), and a(80), which like a(66) is a graph-theory question. (End)
%H Seth A. Troisi, <a href="/A051070/b051070.txt">Table of n, a(n) for n = 1..57</a> (terms 1..48 from Pontus von Brömssen).
%H N. J. A. Sloane, <a href="http://neilsloane.com/doc/sg.txt">My favorite integer sequences</a>, in Sequences and their Applications (Proceedings of SETA '98).
%H N. J. A. Sloane, <a href="https://arxiv.org/abs/2301.03149">"A Handbook of Integer Sequences" Fifty Years Later</a>, arXiv:2301.03149 [math.NT], 2023, p. 21.
%H <a href="/index/Se#selfies">Index entries for sequences whose definition involves A_n (or An)</a>.
%e a(19) = 8 because A000019(19) = 8.
%e a(20) = 24000 because A000020(20) = 24000.
%p for m from 1 do
%p url:= sprintf("https://oeis.org/A%06d/b%06d.txt",m,m);
%p S:= URL:-Get(url);
%p L:= StringTools[Split](S,"\n");
%p for t in L do
%p g:= sscanf(t, "%d %d");
%p if nops(g) = 2 and g[1] = m then
%p a[m]:= g[2];
%p break
%p fi;
%p od;
%p if not assigned(a[m]) then break fi;
%p od:
%p seq(a[i],i=1..m-1); # _Robert Israel_, May 31 2015
%Y See A091967, A107357, A102288 for other versions. See also A031214, A031135.
%Y Cf. A000019, A000020, A000058.
%K easy,sign
%O 1,2
%A _Robert G. Wilson v_, Aug 23 2000
%E Rechecked and 4 more terms added by _N. J. A. Sloane_, May 25 2005
%E a(36) and a(42) corrected and a(43) to a(46) added by _Robert Israel_, May 31 2015
%E Definition revised by _N. J. A. Sloane_, Nov 27 2016
|
