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!)
A098972 a(0) = 1; for n > 0, a(n) = 2*a(floor(n/2)) + 3*a(floor(n/3)). 1
1, 5, 13, 25, 41, 41, 89, 89, 121, 157, 157, 157, 301, 301, 301, 301, 365, 365, 581, 581, 581, 581, 581, 581, 965, 965, 965, 1073, 1073, 1073, 1073, 1073, 1201, 1201, 1201, 1201, 2065, 2065, 2065, 2065, 2065, 2065, 2065, 2065, 2065, 2065, 2065, 2065, 3025 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
a(n) > a(n-1) iff n is a 3-smooth number.
LINKS
FORMULA
sign(a(n+1)-a(n)) = A065333(n+1).
MATHEMATICA
a[0] = 1; a[n_] := a[n] = 2*a[Floor[n/2]] + 3*a[Floor[n/3]]; Array[a, 50, 0] (* Amiram Eldar, Jul 13 2023 *)
PROG
(PARI) a(n)=if(n<1, 1, a(floor(n/2))*2+3*a(floor(n/3)))
CROSSREFS
Sequence in context: A194811 A112558 A248160 * A081961 A096891 A001844
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Oct 23 2004
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 29 00:08 EDT 2024. Contains 372097 sequences. (Running on oeis4.)