cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A308170 Start with the number 7, repeatedly square every digit in place to get a new number; in the limit this process converges (reading from right to left) to the string shown here.

This page as a plain text file.
%I A308170 #39 Jul 09 2025 04:46:52
%S A308170 1,6,3,9,1,8,1,4,6,1,6,1,6,3,1,6,3,1,6,3,9,1,6,3,9,1,6,3,9,1,8,1,6,3,
%T A308170 9,1,8,1,6,3,9,1,8,1,4,6,1,6,3,9,1,8,1,4,6,1,6,3,9,1,8,1,4,6,1,6,1,6,
%U A308170 3,1,6,3,9,1,8,1,4,6,1,6,1,6,3,1,6,3,9
%N A308170 Start with the number 7, repeatedly square every digit in place to get a new number; in the limit this process converges (reading from right to left) to the string shown here.
%C A308170 If we start with 3 or 9, we get the same sequence. If instead we start with 2, 4, 6, or 8 we get the same sequence but without the initial 1. If we start with 5 we get A308171. [Corrected by _M. F. Hasler_, May 15 2019]
%C A308170 Comment from _Jean-Paul Allouche_, May 15 2019: These sequences can be obtained in the order shown (that is, in the right-to-left order) by starting with 7 (say), and repeatedly applying the morphism on the alphabet {1,2,3,...,9} defined by 1 -> 1, 3 -> 9, 4 -> 61, 5 -> 52, 6 -> 63, 7 -> 94, 8 -> 46, 9 -> 18.
%C A308170 If we start with 1, application of the morphism will never change that initial sequence of length 1: this is the third fixed point of the morphism. - _M. F. Hasler_, May 15 2019
%H A308170 Rémy Sigrist, <a href="/A308170/b308170.txt">Table of n, a(n) for n = 1..25000</a>
%e A308170 The successive numbers that arise are
%e A308170 7
%e A308170 49
%e A308170 1681
%e A308170 136641
%e A308170 193636161
%e A308170 1819369361361
%e A308170 1641819368193619361
%e A308170 ...
%e A308170 and reading from the right we see 1,6,3,9, ...
%o A308170 (PARI) { wanted = 87; a = [7]; while (1, b = concat(apply(d -> if (d,digits(d^2),[0]),a)); if (#b > wanted, b = b[#b-wanted+1..#b]); if (a==b, break, a = b)); print (Vecrev(a)) } \\ _Rémy Sigrist_, May 15 2019
%o A308170 (PARI) A308170_vec(N,a=[9])={while(a!=a=concat(apply(t->digits(t^2),if(#a>N,a[-N..-1],a))),); Vecrev(a[-N..-1])} \\ _M. F. Hasler_, May 15 2019
%Y A308170 Cf. A048385, A061588, A082027, A308171.
%K A308170 nonn,base
%O A308170 1,2
%A A308170 _N. J. A. Sloane_, May 15 2019, following a suggestion from _Jeremy Gardiner_
%E A308170 More terms from _Rémy Sigrist_, May 15 2019