|
Search: id:A071641
|
|
|
| A071641 |
|
This is really two sequences: first, a theta 1 based minimal Pisot Fibonacci sequences is produced by the Marsaglia-Zaman carry type of procedure. That sequence is then used to index the primes so that a six letter word pseudorational sequence is produced. The idea was to produce a pseudorational number that didn't depend solely on the primes. So the primes are indexed by a pseudorandom number sequence to produce a first digit pseudorational sequence that depends on the theta 1 minimal Pisot instead of the primes. |
|
+0
1
|
|
| 1, 1, 1, 1, 3, 7, 9, 3, 7, 3, 7, 3, 5, 7, 7, 7, 9, 8, 7, 5, 7, 7, 3, 3, 9, 3, 3, 1, 7, 7, 3, 8, 8, 3, 5, 7, 1, 1, 7, 8, 7, 7, 3, 3, 7, 3, 3, 8, 7, 7, 7, 7, 7, 9, 8, 7, 5, 7, 7, 1, 1, 3, 3, 8, 7, 3, 5, 1, 3, 8, 5, 3, 5, 3, 1, 7, 1, 3, 7, 7, 9, 7, 9, 3, 3, 7, 7, 7, 7, 3, 7, 3, 9, 5, 9, 7, 3, 7, 8, 5, 9, 7, 9, 5, 5
(list; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
COMMENT
|
To get the pseudorational number I chop off the first four 1's.
|
|
REFERENCES
|
Ivars Peterson, The Jungles of Randomness, 1998, John Wiley and Sons, Inc., page 207
|
|
FORMULA
|
f(n)=f(n-1)+f(n-4)+integer(f(n-1)/10+f(n-4)/10) g(x)=9-mod(f(x), 9) h(x)=10 mod(Prime(g(x)), 10)
|
|
EXAMPLE
|
The first prime indexed by the sequence is 29. 10-mod(29,10)=1 The second prime afte four repeats of 29 is 23: 10-mod(23,10)=3
|
|
MATHEMATICA
|
f[0]=f[1]=f[2]=f[3]=1; f[x_] := f[x]=f[x-1]+f[x-4]+Floor[f[x-1]/10+f[x-4]/10]; g[x_] := g[x]=9-Mod[f[x], 9]; h[x_] := h[x]=10-Mod[Prime[g[x]], 10]; Table[h[n], {n, 0, 200}]; ps = RealDigits[ N[ Sum[ h[n]*10^(3 - n), {n, 0, 200}], 105]][[1]]
|
|
CROSSREFS
|
Cf. A072003.
Sequence in context: A131712 A072845 A021729 this_sequence A093336 A038135 A087655
Adjacent sequences: A071638 A071639 A071640 this_sequence A071642 A071643 A071644
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Jun 22 2002
|
|
EXTENSIONS
|
Edited by Robert G. Wilson v (rgwv(AT)rgwv.com), Jun 25 2002
|
|
|
Search completed in 0.002 seconds
|
