A246628 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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

Other ways to Give

A246628

a(1)=1, a(n+1) is the smallest number m such that A244448(a(n)) < A244448(m).

%I #13 Mar 18 2020 08:15:55

%S 1,2,10,635,1810,4502,7598,11117,32146,32770,58079

%N a(1)=1, a(n+1) is the smallest number m such that A244448(a(n)) < A244448(m).

%C This is the related subsequence of A244448 that gives A244448(a(n)) for each n.

%Y Cf. A244448, A246629.

%K nonn,more

%O 1,2

%A _Jahangeer Kholdi_ and _Farideh Firoozbakht_, Sep 01 2014

%E a(8)-a(11) from _Jinyuan Wang_, Mar 18 2020