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

 


a(n) = position of first occurrence of n in A093578. I.e., A093578(a(n)) = n and a(n) is the smallest number for which that is true.
0

%I #4 Jul 28 2017 23:38:10

%S 2,0,28,105,217,259,407,511,406,598,700,889,997,1081,1162,1235,1183,

%T 1396,1501,1609,1606,1624,1777,1987,1921,1942,2059,2237,2108,2404,

%U 2401,2362,2464,2425,2657,2812,2824,2809,2821,2887,3080,2947,3299,3244,3460

%N a(n) = position of first occurrence of n in A093578. I.e., A093578(a(n)) = n and a(n) is the smallest number for which that is true.

%e a(2) = 28 because 28 is the smallest number for which A093578 equals 2.

%Y Cf. A093578.

%K easy,nonn

%O 0,1

%A _Howard A. Landman_, Apr 01 2004

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 20 18:47 EDT 2024. Contains 376075 sequences. (Running on oeis4.)