|
Search: id:A072067
|
|
|
| A072067 |
|
Let b(n) = floor((n+1)*log(2)/log(prime(n+1))). Then a(n) = floor(2^(n/b(n-1)). |
|
+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 2: in Sierpinski gasket type sets the number s(n)=log(prime(n))/log(2) is the Moran dimension of unique fractal types.
The sequence increases slowly and has an alternating effect so that it dips after reaching a peak.
|
|
LINKS
|
Matthew M. Conroy, Home Page (listed instead of email address)
|
|
MATHEMATICA
|
f[n_]=Floor[(n+1)*Log[2]/Log[Prime[n+1]]] h[n_]=Floor[2^(n/f[n-1]] Table[h[n], {n, 1, 200}]
|
|
CROSSREFS
|
Sequence in context: A101440 A126605 A072049 this_sequence A113699 A115213 A009714
Adjacent sequences: A072064 A072065 A072066 this_sequence A072068 A072069 A072070
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Jul 30 2002
|
|
EXTENSIONS
|
More terms from Matthew M. Conroy Apr 19 2003
|
|
|
Search completed in 0.002 seconds
|
