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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A262036 a(n) is the least k such that A261865(k) = A005117(n). 2

%I #10 Sep 22 2015 18:27:13

%S 1,3,40,61,23,170,99,54,662,30,993,880,307,877,1007,3523,8562,5039,

%T 18757,12724,9819,5602,2512,184,10597,33155,43913,8091,16060,59212,

%U 169123,155029,198843,103553,16907,169461,20993,97267,719169,484152,264386,427060

%N a(n) is the least k such that A261865(k) = A005117(n).

%C This sequence has offset 2 because there is no integer k such that A261865(k) = A005117(1) = 1.

%H Peter Kagey, <a href="/A262036/b262036.txt">Table of n, a(n) for n = 2..100</a>

%e a(4) = 40 because A261865(40) = A005117(4) = 5 (and there is no smaller k such that A261865(k) = A005117(4) = 5).

%Y Cf. A005117, A261865.

%K nonn

%O 2,2

%A _Peter Kagey_, Sep 08 2015

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 21 17:21 EDT 2023. Contains 365503 sequences. (Running on oeis4.)