login
A093095
Start with a(1)=2, a(2)=3, then apply the rule of A093094.
2
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,1
REFERENCES
Hugo Steinhaus: Studentenfutter, Urania, Leipzig 1991, #1
LINKS
EXAMPLE
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)
PROG
(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
CROSSREFS
Cf. A093094.
Sequence in context: A368547 A346560 A084459 * A260611 A263502 A002171
KEYWORD
nonn,base
AUTHOR
Bodo Zinser, Mar 20 2004
STATUS
approved