login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093094 "Products into digits": start with a(1)=2, a(2)=2; adjoin digits of product of a(k) and a(k+1) for k from 1 to infinity. 5

%I #18 Feb 15 2024 14:19:54

%S 2,2,4,8,3,2,2,4,6,4,8,2,4,2,4,3,2,1,6,8,8,8,1,2,6,2,6,4,8,6,4,6,4,8,

%T 2,1,2,1,2,1,2,2,4,3,2,4,8,2,4,2,4,2,4,3,2,1,6,2,2,2,2,2,2,4,8,1,2,6,

%U 8,3,2,1,6,8,8,8,8,8,1,2,6,2,6,1,2,4,4,4,4,4,8,3,2,8,2,1,2,4,8,2,4

%N "Products into digits": start with a(1)=2, a(2)=2; adjoin digits of product of a(k) and a(k+1) for k from 1 to infinity.

%C Only the digits 1,2,3,4,6,8 occur, infinitely often. The sequence is not periodic. Around a(800) there are many 8's.

%C From _Giovanni Resta_, Mar 16 2006: (Start)

%C Proof that sequence is not periodic:

%C Let us assume that somewhere in the sequence there is a subsequence of 3 adjacent 8': ...,8,8,8,....(which is true).

%C Then we know that in the following there will be the subsequence ...,6,4,6,4.. (i.e. 8x8, 8x8) again, there will be somewhere ...,2,4,2,4,2,4,... (i.e. 6x4, 4x6, 6x4) and finally ...,8,8,8,8,8,...

%C Analogously, starting from 8,8,8,8 we obtain 6,4,6,4,6,4 then 2,4,2,4,2,4,2,4,2,4 and finally 8,8,8,8,8,8,8,8,8.

%C Generalizing, if somewhere appears a run of k>2 8's, then in some future position will appear a run of at least 4*k-7 8's (where since k>2, 4*k-7>k).

%C So the sequence will contain arbitrary long runs of 8's, without being constantly equal to 8, thus it cannot be periodic. (End)

%C Essentially the same as A045777. [_R. J. Mathar_, Sep 08 2008]

%H Reinhard Zumkeller, <a href="/A093094/b093094.txt">Table of n, a(n) for n = 1..10000</a>

%e a(3)=a(1)*a(2), a(4)=a(2)*a(3), a(5)=first digit of (a(3)*a(4)), a(6)=2nd digit of (a(3)*a(4)), a(9)=a(6)*a(7)

%o (Haskell)

%o a093094 n = a093094_list !! (n-1)

%o a093094_list = f [2,2] where

%o f (u : vs@(v : _)) = u : f (vs ++

%o if w < 10 then [w] else uncurry ((. return) . (:)) $ divMod w 10)

%o where w = u * v

%o -- _Reinhard Zumkeller_, Aug 08 2013

%o (Python)

%o from itertools import islice

%o from collections import deque

%o def agen(): # generator of terms

%o a = deque([2, 2])

%o while True:

%o a.extend(list(map(int, str(a[0]*a[1]))))

%o yield a.popleft()

%o print(list(islice(agen(), 101))) # _Michael S. Branicky_, Feb 15 2024

%Y Cf. A093086, A093087, A093088, A093089, A093090, A093091.

%K nonn,base

%O 1,1

%A _Bodo Zinser_, Mar 20 2004

%E Definition revised by _Franklin T. Adams-Watters_, Mar 16 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 19:31 EDT 2024. Contains 371962 sequences. (Running on oeis4.)