|
|
A187532
|
|
a(n) = 4^n mod 19.
|
|
2
|
|
|
1, 4, 16, 7, 9, 17, 11, 6, 5, 1, 4, 16, 7, 9, 17, 11, 6, 5, 1, 4, 16, 7, 9, 17, 11, 6, 5, 1, 4, 16, 7, 9, 17, 11, 6, 5, 1, 4, 16, 7, 9, 17, 11, 6, 5, 1, 4, 16, 7, 9, 17, 11, 6, 5, 1, 4, 16, 7, 9, 17, 11, 6, 5, 1, 4, 16, 7, 9, 17, 11, 6, 5, 1, 4, 16, 7, 9, 17, 11, 6, 5
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Period 9: repeat (1,4,16,7,9,17,11,6,5).
Also continued fraction expansion of (13140908+sqrt(323139488118562))/24969762. - Bruno Berselli, Sep 09 2011
|
|
LINKS
|
|
|
FORMULA
|
a(n+9) = a(n).
G.f.: (1 + 4*x + 16*x^2 + 7*x^3 + 9*x^4 + 17*x^5 + 11*x^6 + 6*x^7 + 5*x^8)/((1-x)*(1+x+x^2)*(1+x^3+x^6)). - Bruno Berselli, Sep 09 2011
|
|
MATHEMATICA
|
PowerMod[4, Range[0, 100], 19] (* or *)
PadRight[{}, 100, {1, 4, 16, 7, 9, 17, 11, 6, 5}] (* Paolo Xausa, Mar 17 2024 *)
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|