Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A133369
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A133369 a(n+1) = 3*a(n) + 2*a(n-1) mod 37; a(0) = 0, a(1) = 1. +0
1
0, 1, 3, 11, 2, 28, 14, 24, 26, 15, 23, 25, 10, 6, 1, 15, 10, 23, 15, 17 (list; graph; listen)
OFFSET

0,3

COMMENT

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

REFERENCES

Gupta, Rockstroh and Su, Splitting fields and Periods of Fibonacci Sequences Mod Primes, arXiv:0909.0362v1; Sep 02 2009.

CROSSREFS

Sequence in context: A069604 A098332 A096663 this_sequence A110123 A110221 A084466

Adjacent sequences: A133366 A133367 A133368 this_sequence A133370 A133371 A133372

KEYWORD

nonn,more

AUTHOR

Gary Adamson (qntmpkt(AT)yahoo.com), Sep 04 2009

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research