This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A092177 #4 Jul 28 2017 23:38:10 %S A092177 2,0,28,105,217,259,407,511,406,598,700,889,997,1081,1162,1235,1183, %T A092177 1396,1501,1609,1606,1624,1777,1987,1921,1942,2059,2237,2108,2404, %U A092177 2401,2362,2464,2425,2657,2812,2824,2809,2821,2887,3080,2947,3299,3244,3460 %N A092177 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 A092177 a(2) = 28 because 28 is the smallest number for which A093578 equals 2. %Y A092177 Cf. A093578. %K A092177 easy,nonn %O A092177 0,1 %A A092177 _Howard A. Landman_, Apr 01 2004