A124904 a(n) = least integer j>=0 such that n = floor[(3^j)/(2^k)] for some integer k>=0.

0, 2, 1, 2, 4, 3, 5, 7, 2, 4, 6, 8, 3, 10, 5, 12, 7, 14, 9, 4, 11, 6, 18, 13, 8, 32, 3, 10, 22, 5, 29, 12, 36, 7, 31, 14, 38, 9, 33, 4, 16, 40, 11, 35, 6, 18, 42, 13, 25, 49, 8, 32, 44, 15, 27, 39, 10, 22, 34, 5, 17, 29, 41, 12, 24, 36, 48, 7, 19, 31, 43, 14, 26, 38, 91, 9, 21, 33, 86

Offset

1,2

Comments

The k-sequence is A124912.

Links

Rémy Sigrist, Table of n, a(n) for n = 1..8192

Rémy Sigrist, Logarithmic scatterplot of the first 2^13 terms

Rémy Sigrist, PARI program for A124904

Example

1=[3^0/2^0], 2=[3^2/2^2], 3=[3^1/2^0], 4=[3^2/2^1],...,
so j-sequence = (0,2,1,2,...); k-sequence = (0,2,0,1,...).

Prog

(PARI) See Links section.

Crossrefs

Cf. A124912.

Sequence in context: A316997 A323465 A364780 * A187500 A323460 A129144

Adjacent sequences: A124901 A124902 A124903 * A124905 A124906 A124907

Keyword

nonn

Author

Clark Kimberling, Nov 12 2006

Status

approved