OFFSET
1,2
COMMENTS
The corresponding maximum product is A000792(n). - Lekraj Beedassy, Nov 13 2009
Except for the first term, terms in the sequence are exactly those numbers formed by sequence of digits 3 followed by either zero, one or two digits 2. - Chai Wah Wu, Dec 11 2015
FORMULA
Conjecture: a(n) = 10*a(n-3)+a(n-6)-10*a(n-9) for n>10. - Colin Barker, Oct 14 2014
Empirical g.f.: x*(90*x^6+10*x^4+11*x^3+3*x^2+2*x+1) / ((x-1)*(x^2+x+1)*(10*x^3-1)). - Colin Barker, Oct 14 2014
For n > 7, a(n) = 11*a(n-3)-10*a(n-6). For n > 4, a(n-3) + 3*10^(floor((n-1)/3)). For n > 1, (2*10^(floor((n+2)/3))+(63*m^2-129*m-2))/6, where m is the least nonnegative residue of n mod 3. - Chai Wah Wu, Dec 11 2015
PROG
(Python)
from __future__ import division
def A083178(n):
return 1 if n == 1 else (2*10**((n+2)//3)+(63*(n%3)**2-129*(n%3)-2))//6 # Chai Wah Wu, Dec 11 2015
CROSSREFS
KEYWORD
base,nonn,easy
AUTHOR
Amarnath Murthy, Apr 26 2003
EXTENSIONS
Corrected and extended by David Wasserman, Oct 25 2004
STATUS
approved