|
Search: id:A077016
|
|
|
| A077016 |
|
a(1) = 1, a(2) = 4, continue by dividing by the smallest prime not used earlier and multiplying with the smallest composite number just greater than the previous prime used in the division and then take the integer part at every step. |
|
+0
1
|
|
| 1, 4, 2, 12, 4, 32, 6, 54, 7, 70, 6, 72, 5, 70, 4, 72, 3, 60, 2, 48, 1, 30, 0
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
a(n) = 0 for n>23. Sequence needs some refinement. Can some improvement be suggested so that no term is zero.
|
|
EXAMPLE
|
a(3) = 4/2 = 2, a(4) = 2*6 = 12, a(5) = 12/3 = 4, a(6) = 4*8 = 32,a(7) = Floor[32/5] = 6.
|
|
CROSSREFS
|
Cf. A076915.
Sequence in context: A010318 A137447 A077015 this_sequence A104007 A152664 A167591
Adjacent sequences: A077013 A077014 A077015 this_sequence A077017 A077018 A077019
|
|
KEYWORD
|
fini,more,nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Oct 28 2002
|
|
|
Search completed in 0.002 seconds
|
