Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #15 Sep 25 2020 11:15:22
%S 0,299,5643,1357259,273624711,17832200896811,26748301350411,
%T 44580503598539,62412976762503,106993205379371,106993205384715,
%U 106993206736331,106993479003783
%N G_10(n), where G is the Goodstein function defined in A266201.
%C a(17) = 1.926...*10^6103. - _Pontus von Brömssen_, Sep 25 2020
%H Pontus von Brömssen, <a href="/A271986/b271986.txt">Table of n, a(n) for n = 3..16</a>
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Goodstein's_theorem">Goodstein's theorem</a>
%o (Python)
%o from sympy.ntheory.factor_ import digits
%o def bump(n,b):
%o s=digits(n,b)[1:]
%o l=len(s)
%o return sum(s[i]*(b+1)**bump(l-i-1,b) for i in range(l) if s[i])
%o def A271986(n):
%o if n==3: return 0
%o for i in range(2,12):
%o n=bump(n,i)-1
%o return n # _Pontus von Brömssen_, Sep 25 2020
%Y Cf. A056004: G_1(n); A057650: G_2(n); A059934: G_3(n); A059935: G_4(n); A059936: G_5(n); A271977: G_6(n); A271978: G_7(n); A271979: G_8(n); A271985: G_9(n); this sequence: G_10(n); A266201: G_n(n).
%K nonn
%O 3,2
%A _Natan Arie Consigli_, May 01 2016
%E Incorrect program and terms removed by _Pontus von Brömssen_, Sep 25 2020