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”).

A356792
Smallest number k with A355915(k) = n.
2
1, 11, 49, 103, 179, 313, 545, 601, 959, 1087, 1675, 1931, 2813, 2909, 3133, 4565, 4673, 6049, 5089, 8837, 8095, 9463, 10883, 14771, 12023, 9911, 15587, 16883, 17891, 18179, 17315, 16739, 26461, 17635, 29221, 30437, 28709, 33161, 39193, 39401, 30757, 40165, 55625
OFFSET
1,2
LINKS
Michael S. Branicky, Table of n, a(n) for n = 1..253
Michael S. Branicky, Python program
FORMULA
a(n) = min_k { A355915(k) = n }.
EXAMPLE
A355915(11) is the first term there with value 2, so a(2) = 11.
PROG
(Python) # see linked program
CROSSREFS
Cf. A355915.
Sequence in context: A239460 A226676 A101992 * A160671 A297521 A295420
KEYWORD
nonn
AUTHOR
STATUS
approved