login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A341699
a(n) is the least m such that A341694(m, k) = n for some k > 0.
4
1, 2, 2, 4, 2, 11, 4, 2, 5, 12, 4, 9, 2, 8, 17, 12, 5, 4, 24, 32, 2, 48, 8, 13, 10, 12, 19, 16, 4, 25, 5, 18, 21, 2, 33, 36, 8, 11, 34, 45, 37, 9, 68, 13, 16, 66, 4, 77, 10, 24, 27, 47, 17, 153, 2, 39, 5, 48, 95, 8, 22, 51, 18, 26, 21, 49, 71, 12, 44, 11, 36
OFFSET
1,2
FORMULA
a(n) <= 2^(n-1).
A341285(n) = A070939(a(n)).
EXAMPLE
The first row of A341694 contains only 1's:
- so a(1) = 1.
The second row of A341694 contains the positive Fibonacci numbers:
- so a(2) = a(3) = a(5) = a(8) = a(13) = a(21) = a(34) = a(55) = ..., = 2.
PROG
(PARI) See Links section.
CROSSREFS
KEYWORD
nonn,look,base
AUTHOR
Rémy Sigrist, Feb 17 2021
STATUS
approved