|
%I #6 Oct 09 2013 14:17:20
%S 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,
%T 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,
%U 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
%N Start with a(1)=2, a(2)=3, then apply the rule of A093094.
%D Hugo Steinhaus: Studentenfutter, Urania, Leipzig 1991, #1
%H Reinhard Zumkeller, <a href="/A093095/b093095.txt">Table of n, a(n) for n = 1..10000</a>
%e 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)
%o (Haskell)
%o a093095 n = a093095_list !! (n-1)
%o a093095_list = f [2,3] 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
%Y Cf. A093094.
%K nonn,base
%O 1,1
%A _Bodo Zinser_, Mar 20 2004
|
