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!)
A335393 a(1) = 1 and for any n >= 1, a(2*n) = a(n) + 5, a(2*n+1) = a(n) * 3. 3
1, 6, 3, 11, 18, 8, 9, 16, 33, 23, 54, 13, 24, 14, 27, 21, 48, 38, 99, 28, 69, 59, 162, 18, 39, 29, 72, 19, 42, 32, 81, 26, 63, 53, 144, 43, 114, 104, 297, 33, 84, 74, 207, 64, 177, 167, 486, 23, 54, 44, 117, 34, 87, 77, 216, 24, 57, 47, 126, 37, 96, 86, 243 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
All terms belong to A335155.
For any k > 0, the value k appears A335392(k) times.
LINKS
FORMULA
a(2^k) = 1 + 5*k for any k >= 0.
a(2^k-1) = 2^(k-1) for any k > 0.
EXAMPLE
a(12) = a(6) + 5 = a(3) + 5 + 5 = a(1) * 3 + 5 + 5 = 1 * 3 + 5 + 5 = 13.
PROG
(PARI) a(n) = { if (n==1, 1, n%2==0, a(n\2)+5, a(n\2)*3) }
CROSSREFS
Sequence in context: A060445 A131894 A368679 * A040033 A165998 A322091
KEYWORD
nonn
AUTHOR
Rémy Sigrist, Jun 05 2020
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 25 10:01 EDT 2024. Contains 371967 sequences. (Running on oeis4.)