

A070337


a(n) = 2^n mod 27.


3



1, 2, 4, 8, 16, 5, 10, 20, 13, 26, 25, 23, 19, 11, 22, 17, 7, 14, 1, 2, 4, 8, 16, 5, 10, 20, 13, 26, 25, 23, 19, 11, 22, 17, 7, 14, 1, 2, 4, 8, 16, 5, 10, 20, 13, 26, 25, 23, 19, 11, 22, 17, 7, 14, 1, 2, 4, 8, 16, 5, 10, 20, 13, 26, 25, 23, 19, 11, 22, 17, 7
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,2


LINKS

Index entries for linear recurrences with constant coefficients, signature (1, 0, 0, 0, 0, 0, 0, 0, 1, 1).


FORMULA

a(n) = a(n1)  a(n9) + a(n10).
G.f.: (1 + x + 2*x^2 + 4*x^3 + 8*x^4  11*x^5 + 5*x^6 + 10*x^7  7*x^8 + 14*x^9)/ ((1x) * (1+x) * (x^2  x + 1) * (x^6  x^3 + 1)). (End)


MATHEMATICA



PROG

(Sage) [power_mod(2, n, 27)for n in range(0, 71)] # Zerinvary Lajos, Nov 03 2009
(GAP) List([0..88], n>PowerMod(2, n, 27)); # Muniru A Asiru, Jan 31 2019


CROSSREFS



KEYWORD

nonn,easy


AUTHOR



STATUS

approved



