|
| |
|
|
A146969
|
|
A prime sequence form based on A003602: a(1)=3, a(2)=1, a(n) = (n+1)/2 if n is an odd prime, and a(n) = a(floor(n/2)) otherwise.
|
|
0
| |
|
|
3, 1, 2, 1, 3, 2, 4, 1, 1, 3, 6, 2, 7, 4, 4, 1, 9, 1, 10, 3, 3, 6, 12, 2, 2, 7, 7, 4, 15, 4, 16, 1, 1, 9, 9, 1, 19, 10, 10, 3, 21, 3, 22, 6, 6, 12, 24, 2, 2, 2, 2, 7, 27, 7, 7, 4, 4, 15, 30, 4, 31, 16, 16, 1, 1, 1, 34, 9, 9, 9, 36, 1, 37, 19, 19, 10, 10, 10, 40, 3, 3, 21, 42, 3, 3, 22, 22, 6, 45, 6
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| I modified Robert Wilson's Mathematica code until I got a working chaotic sequence.
|
|
|
MATHEMATICA
| a[1] = 3; a[2] = 1; a[n_] := a[n] = If[PrimeQ[n], (n + 1)/2, a[Floor[n/2]]]; Table[a[n], {n, 1, 100}]
|
|
|
CROSSREFS
| Sequence in context: A029351 A178638 A035115 * A090270 A178830 A029329
Adjacent sequences: A146966 A146967 A146968 * A146970 A146971 A146972
|
|
|
KEYWORD
| nonn,less
|
|
|
AUTHOR
| Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Nov 03 2008
|
| |
|
|
