cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A335393 a(1) = 1 and for any n >= 1, a(2*n) = a(n) + 5, a(2*n+1) = a(n) * 3.

Original entry on oeis.org

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
Offset: 1

Views

Author

Rémy Sigrist, Jun 05 2020

Keywords

Comments

All terms belong to A335155.
For any k > 0, the value k appears A335392(k) times.

Examples

			a(12) = a(6) + 5 = a(3) + 5 + 5 = a(1) * 3 + 5 + 5 = 1 * 3 + 5 + 5 = 13.
		

Crossrefs

Programs

  • PARI
    a(n) = { if (n==1, 1, n%2==0, a(n\2)+5, a(n\2)*3) }

Formula

a(2^k) = 1 + 5*k for any k >= 0.
a(2^k-1) = 2^(k-1) for any k > 0.