Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A106291
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A106291 Period of the Lucas sequence A000032 mod n. +0
1
1, 3, 8, 6, 4, 24, 16, 12, 24, 12, 10, 24, 28, 48, 8, 24, 36, 24, 18, 12, 16, 30, 48, 24, 20, 84, 72, 48, 14, 24, 30, 48, 40, 36, 16, 24, 76, 18, 56, 12, 40, 48, 88, 30, 24, 48, 32, 24, 112, 60, 72, 84, 108, 72, 20, 48, 72, 42, 58, 24, 60, 30, 48, 96, 28, 120, 136, 36, 48, 48 (list; graph; listen)
OFFSET

1,2

COMMENT

This sequence differs from the Fibonacci periods (A001175) only when n is a multiple of 5, which can be traced to 5 being the discriminant of the characteristic polynomial x^2-x-1.

LINKS

Eric Weisstein's World of Mathematics, Fibonacci n-Step

FORMULA

Let the prime factorization of n be p1^e1...pk^ek. Then a(n) = lcm(a(p1^e1), ..., a(pk^ek)).

MATHEMATICA

n=2; Table[p=i; a=Join[Table[ -1, {n-1}], {n}]; a=Mod[a, p]; a0=a; k=0; While[k++; s=Mod[Plus@@a, p]; a=RotateLeft[a]; a[[n]]=s; a!=a0]; k, {i, 70}]

CROSSREFS

Cf. A106273 (discriminant of the polynomial x^n-x^(n-1)-...-x-1).

Sequence in context: A081803 A016627 A019604 this_sequence A137987 A020809 A154199

Adjacent sequences: A106288 A106289 A106290 this_sequence A106292 A106293 A106294

KEYWORD

nonn

AUTHOR

T. D. Noe (noe(AT)sspectra.com), May 02 2005

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 December 7 08:40 EST 2009. Contains 170430 sequences.


AT&T Labs Research