The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.



(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A072049 a(n) = floor(2^(n/(floor(n*log(2)/log(prime(n)))))). 1


%S 2,4,8,16,32,64,128,256,512,32,45,64,90,128,181,256,362,64,80,101,128,

%T 161,203,256,322,406,107,128,152,181,215,256,304,362,430,512,168,194,

%U 222,256,294,337,388,445,512,203,228,256,287,322,362,406,456,512,574

%N a(n) = floor(2^(n/(floor(n*log(2)/log(prime(n)))))).

%C The sequence comes from the relationship of the primes to powers of two: in SierpiƄski 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.

%C The sequence is slow to increase and has an alternating effect so that it dips lower after reaching a peak.

%t Table[Floor[2^(n/(Floor[n * Log[2]/Log[Prime[n]]]))], {n, 60}]

%K nonn

%O 1,1

%A _Roger L. Bagula_, Jul 30 2002

%E Edited by _Robert G. Wilson v_, Jul 31 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 16 19:49 EDT 2021. Contains 345068 sequences. (Running on oeis4.)