

A133369


a(n+1) = (3*a(n) + 2*a(n1)) mod 37; a(0) = 0, a(1) = 1.


1



0, 1, 3, 11, 2, 28, 14, 24, 26, 15, 23, 25, 10, 6, 1, 15, 10, 23, 15, 17, 7, 18, 31, 18, 5, 14, 15, 36, 27, 5, 32, 32, 12, 26, 28, 25, 20, 36, 0, 35, 31, 15, 33, 18, 9, 26, 22, 7, 28, 24, 17, 25, 35, 7, 17, 28, 7, 3, 23, 1, 12, 1, 27, 9, 7, 2, 20, 27, 10, 10, 13, 22, 18, 24, 34, 2, 0, 4
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,3


COMMENTS

Has period 1368 = (37 + 1) * (37  1), indicating that all possible consecutive pairs other than 0,0 appear.


LINKS

Michel Marcus, Table of n, a(n) for n = 0..1400
Gupta, Rockstroh and Su, Splitting fields and Periods of Fibonacci Sequences Mod Primes, arXiv:0909.0362v1; Sep 02 2009.


MATHEMATICA

RecurrenceTable[{a[0]==0, a[1]==1, a[n]==Mod[3a[n1]+2a[n2], 37]}, a, {n, 80}] (* Harvey P. Dale, Apr 11 2014 *)


CROSSREFS

Sequence in context: A098332 A096663 A302120 * A110123 A110221 A244237
Adjacent sequences: A133366 A133367 A133368 * A133370 A133371 A133372


KEYWORD

nonn


AUTHOR

Gary W. Adamson, Sep 04 2009


EXTENSIONS

More terms from Max Alekseyev, Apr 18 2010
Definition clarified by Harvey P. Dale, Apr 11 2014


STATUS

approved



