login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A146969 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; text; internal format)
OFFSET
1,1
LINKS
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: A290496 A035115 A370897 * A338804 A090270 A326441
KEYWORD
nonn,less
AUTHOR
Roger L. Bagula, Nov 03 2008
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 27 07:11 EDT 2024. Contains 372009 sequences. (Running on oeis4.)