|
|
A180594
|
|
Digital root of 4n.
|
|
7
|
|
|
0, 4, 8, 3, 7, 2, 6, 1, 5, 9, 4, 8, 3, 7, 2, 6, 1, 5, 9, 4, 8, 3, 7, 2, 6, 1, 5, 9, 4, 8, 3, 7, 2, 6, 1, 5, 9, 4, 8, 3, 7, 2, 6, 1, 5, 9, 4, 8, 3, 7, 2, 6, 1, 5, 9, 4, 8, 3, 7, 2, 6, 1, 5, 9, 4, 8, 3, 7, 2, 6, 1, 5, 9, 4, 8, 3, 7, 2, 6, 1, 5, 9, 4, 8, 3, 7, 2, 6, 1, 5, 9, 4, 8, 3, 7, 2, 6, 1, 5, 9, 4, 8, 3, 7, 2
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
G.f.: -x*(9*x^8+5*x^7+x^6+6*x^5+2*x^4+7*x^3+3*x^2+8*x+4)/((x-1)*(x^2+x+1)*(x^6+x^3+1)). - Colin Barker, Sep 23 2012
|
|
MATHEMATICA
|
f[n_] := Mod[4 n - 1, 9] + 1; f[0] = 0; Array[f, 105, 0] (* Robert G. Wilson v, Sep 20 2010 *)
Join[{0}, ReplaceAll[Table[Mod[4n, 9], {n, 99}], {0 -> 9}]] (* Alonso del Arte, Sep 23 2012 *)
LinearRecurrence[{0, 0, 0, 0, 0, 0, 0, 0, 1}, {0, 4, 8, 3, 7, 2, 6, 1, 5, 9}, 120] (* or *) PadRight[ {0}, 120, {9, 4, 8, 3, 7, 2, 6, 1, 5}] (* Harvey P. Dale, Aug 09 2022 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn,base
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|