The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A072049

(Bold, blue-underlined text is an ; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A072049

a(n) = floor(2^(n/(floor(n*log(2)/log(prime(n)))))).
(history; published version)

#12 by Joerg Arndt at Sun Nov 19 01:42:41 EST 2017

STATUS

proposed

#11 by Alonso del Arte at Sat Nov 18 22:23:18 EST 2017

STATUS

editing

#10 by Alonso del Arte at Sat Nov 18 22:22:53 EST 2017

MATHEMATICA

a[n_] := Floor[2^(n/(Floor[n*Log[2]/Log[Prime[n]]]))]; Table[ a[n], {n, 1, 60}]

STATUS

proposed

#9 by Jon E. Schoenfield at Sat Nov 18 21:48:08 EST 2017

STATUS

editing

#8 by Jon E. Schoenfield at Sat Nov 18 21:48:04 EST 2017

NAME

Floor(2^(n /{Floor(n*log(2)/log(Prime(n)))} )).

STATUS

approved

#7 by Jon E. Schoenfield at Fri Mar 06 23:21:28 EST 2015

STATUS

editing

#6 by Jon E. Schoenfield at Fri Mar 06 23:21:26 EST 2015

COMMENTS

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.

STATUS

approved

#5 by Russ Cox at Fri Mar 30 17:34:12 EDT 2012

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Jul 30 2002

Discussion

Fri Mar 30

17:34

OEIS Server: https://oeis.org/edit/global/158

#4 by Russ Cox at Fri Mar 30 17:30:44 EDT 2012

EXTENSIONS

Edited by Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 31 2002

Discussion

Fri Mar 30

17:30

OEIS Server: https://oeis.org/edit/global/156

#3 by N. J. A. Sloane at Fri Feb 24 03:00:00 EST 2006

MATHEMATICA

a[n_] := Floor[2^(n/(Floor[n*Log[2]/Log[Prime[n]]]))]; Table[ a[n], {n, 1, 60}]

KEYWORD

nonn,new