|
Search: id:A072049
|
|
|
| A072049 |
|
Floor(2^(n /{Floor(n*log(2)/log(Prime(n)))} )). |
|
+0
1
|
|
| 2, 4, 8, 16, 32, 64, 128, 256, 512, 32, 45, 64, 90, 128, 181, 256, 362, 64, 80, 101, 128, 161, 203, 256, 322, 406, 107, 128, 152, 181, 215, 256, 304, 362, 430, 512, 168, 194, 222, 256, 294, 337, 388, 445, 512, 203, 228, 256, 287, 322, 362, 406, 456, 512, 574
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
The sequence comes from the relationship of the primes to powers of two: in Sierpinski gasket sets the number s(n)=log(prime(n))/log(2) is the Moran dimension of unique fractal types. I first thought of making numbers that take these to integers by multiplication. And then of using integers of those to make other integers as powers of two that were prime like.
The sequence is slow to increase and has an alternating effect so that it dips lower after reaching a peak.
|
|
MATHEMATICA
|
a[n_] := Floor[2^(n/(Floor[n*Log[2]/Log[Prime[n]]]))]; Table[ a[n], {n, 1, 60}]
|
|
CROSSREFS
|
Sequence in context: A054842 A101440 A126605 this_sequence A072067 A113699 A115213
Adjacent sequences: A072046 A072047 A072048 this_sequence A072050 A072051 A072052
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Jul 30 2002
|
|
EXTENSIONS
|
Edited by Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 31 2002
|
|
|
Search completed in 0.002 seconds
|
