login
A095915
Each number is twice times the product of the digits of the previous number.
0
1, 2, 4, 8, 16, 12, 4, 8, 16, 12, 4, 8, 16, 12, 4, 8, 16, 12, 4, 8, 16, 12, 4, 8, 16, 12, 4, 8, 16, 12, 4, 8, 16, 12, 4, 8, 16, 12, 4, 8, 16, 12, 4, 8, 16, 12, 4, 8, 16, 12, 4, 8, 16, 12, 4, 8, 16, 12, 4, 8, 16, 12, 4, 8, 16, 12, 4, 8, 16, 12, 4, 8, 16, 12, 4, 8, 16, 12, 4, 8, 16, 12, 4, 8, 16
OFFSET
1,2
FORMULA
From R. J. Mathar, Apr 13 2010:
a(n) = 2^(n-1) mod 20;
a(n) = a(n-1) - a(n-2) + a(n-3), n > 5.
G.f.: x*(3*x^2+5*x^3+10*x^4+x+1)/((1-x)*(1+x^2)).
PROG
(Sage) [power_mod(2, n, 20)for n in range(0, 85)] # Zerinvary Lajos, Nov 03 2009
CROSSREFS
Sequence in context: A020954 A070347 A342072 * A208278 A036120 A334629
KEYWORD
base,nonn
AUTHOR
Herman Jamke (hermanjamke(AT)fastmail.fm), Jul 13 2004
STATUS
approved