|
Search: id:A106302
|
|
|
| A106302 |
|
Period of the Fibonacci 3-step sequence A000073 mod prime(n). |
|
+0
5
|
|
| 4, 13, 31, 48, 110, 168, 96, 360, 553, 140, 331, 469, 560, 308, 46, 52, 3541, 1860, 1519, 5113, 5328, 3120, 287, 8011, 3169, 680, 51, 1272, 990, 12883, 5376, 5720, 18907, 3864, 7400, 2850, 8269, 162, 9296, 2494, 32221, 10981, 36673, 4656, 3234, 198, 5565
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
This sequence differs from the corresponding Lucas sequence (A106294) at n=1 and 5 because these correspond to the primes 2 and 11, which are the prime factors of -44, the discriminant of the characteristic polynomial x^3-x^2-x-1. We have a(n) < prime(n) for the primes in A106279.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n = 1..1000
Eric Weisstein's World of Mathematics, Fibonacci n-Step
|
|
MATHEMATICA
|
n=3; Table[p=Prime[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, 60}]
|
|
CROSSREFS
|
Cf. A106273 (discriminant of the polynomial x^n-x^(n-1)-...-x-1), A106279 (primes p such that x^3-x^2-x-1 mod has 3 distinct zeros), A106294 (period of Lucas 3-step sequence mod prime(n)).
Sequence in context: A071400 A075880 A042487 this_sequence A100136 A097120 A098536
Adjacent sequences: A106299 A106300 A106301 this_sequence A106303 A106304 A106305
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
T. D. Noe (noe(AT)sspectra.com), May 02 2005
|
|
|
Search completed in 0.002 seconds
|
