# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a222112
Showing 1-1 of 1

%I A222112 #19 Apr 24 2024 11:11:02
%S A222112 0,1,3,4,27,28,30,31,81,82,84,85,108,109,111,112,7625597484987,
%T A222112 7625597484988,7625597484990,7625597484991,7625597485014,
%U A222112 7625597485015,7625597485017,7625597485018,7625597485068,7625597485069,7625597485071,7625597485072,7625597485095
%N A222112 Initial step in Goodstein sequences: write n-1 in hereditary binary representation, then bump to base 3.
%C A222112 See A056004 for an alternate version.
%D A222112 Helmut Schwichtenberg and Stanley S. Wainer, Proofs and Computations, Cambridge University Press, 2012; 4.4.1, page 148ff.
%H A222112 Reinhard Zumkeller, <a href="/A222112/b222112.txt">Table of n, a(n) for n = 1..10000</a>
%H A222112 R. L. Goodstein, <a href="http://www.jstor.org/stable/2268019">On the Restricted Ordinal Theorem</a>, The Journal of Symbolic Logic, Vol. 9, No. 2, Jun., 1944.
%H A222112 Wikipedia, <a href="http://en.wikipedia.org/wiki/Goodstein&#39;s_theorem">Goodstein's Theorem</a>
%H A222112 Reinhard Zumkeller, <a href="/A211378/a211378.hs.txt">Haskell programs for Goodstein sequences</a>
%e A222112 n = 19: 19 - 1 = 18 = 2^4 + 2^1 = 2^2^2 + 2^1
%e A222112 -> a(19) = 3^3^3 + 3^1 = 7625597484990;
%e A222112 n = 20: 20 - 1 = 19 = 2^4 + 2^1 + 2^0 = 2^2^2 + 2^1 + 2^0
%e A222112 -> a(20) = 3^3^3 + 3^1 + 3^0 = 7625597484991;
%e A222112 n = 21: 21 - 1 = 20 = 2^4 + 2^2 = 2^2^2 + 2^2
%e A222112 -> a(21) = 3^3^3 + 3^3 = 7625597485014.
%o A222112 (Haskell) -- See Link
%o A222112 (PARI) A222112(n)=sum(i=1, #n=binary(n-1), if(n[i],3^if(#n-i<2, #n-i, A222112(#n-i+1)))) \\ See A266201 for more general code. - _M. F. Hasler_, Feb 13 2017, edited Feb 19 2017
%Y A222112 Cf. A056004: G_1(n), A057650 G_2(n), A056041;  A266201: G_n(n);
%Y A222112 Cf. A215409: G_n(3), A056193: G_n(4), A266204: G_n(5), A266205: G_n(6), A222117: G_n(15), A059933: G_n(16), A211378: G_n(19).
%K A222112 nonn
%O A222112 1,3
%A A222112 _Reinhard Zumkeller_, Feb 13 2013

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE