A093095 Start with a(1) = 2, a(2) = 3, then apply the rule of A093094.

2, 3, 6, 1, 8, 6, 8, 4, 8, 4, 8, 3, 2, 3, 2, 3, 2, 3, 2, 2, 4, 6, 6, 6, 6, 6, 6, 6, 4, 8, 2, 4, 3, 6, 3, 6, 3, 6, 3, 6, 3, 6, 3, 6, 2, 4, 3, 2, 1, 6, 8, 1, 2, 1, 8, 1, 8, 1, 8, 1, 8, 1, 8, 1, 8, 1, 8, 1, 8, 1, 8, 1, 8, 1, 8, 1, 2, 8, 1, 2, 6, 2, 6, 4, 8, 8, 2, 2, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8

Offset: 1

Author

Bodo Zinser, Mar 20 2004

Keywords

• nonn
• base

Examples

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

References

• Hugo Steinhaus, Studentenfutter, Urania, Leipzig 1991, #1.

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A045777, A060310, A093094, A093096, A093097, A096381.

Programs

Haskell

a093095 n = a093095_list !! (n-1)
a093095_list = f [2,3] where
   f (u : vs@(v : _)) = u : f (vs ++
     if w < 10 then [w] else uncurry ((. return) . (:)) $ divMod w 10)
        where w = u * v
-- Reinhard Zumkeller, Aug 08 2013

Mathematica

Fold[Join[#, IntegerDigits[Times @@ #[[#2;; #2+1]]]] &, {2, 3}, Range[100]] (* Paolo Xausa, Aug 18 2025 *)

Python

from itertools import islice
from collections import deque
def agen(): # generator of terms
    a = deque([2, 3])
    while True:
        a.extend(list(map(int, str(a[0]*a[1]))))
        yield a.popleft()
print(list(islice(agen(), 105))) # Michael S. Branicky, Aug 18 2025