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 A277593 #9 Jan 31 2017 00:59:13 %S A277593 6,16,26,36,46,56,60,66,76,86,96,106,116,126,136,146,156,160,166,176, %T A277593 186,196,206,216,226,236,246,256,260,266,276,286,296,306,316,326,336, %U A277593 346,356,360,366,376,386,396,406,416,426,436,446,456,460,466,476,486 %N A277593 Numbers k such that k/10^m == 6 mod 10, where 10^m is the greatest power of 10 that divides n. %C A277593 Positions of 6 in A065881. %C A277593 Numbers having 6 as rightmost nonzero digit in base 10. This is one sequence in a 10-way splitting of the positive integers; the other nine are indicated in the Mathematica program. %H A277593 Clark Kimberling, <a href="/A277593/b277593.txt">Table of n, a(n) for n = 1..10000</a> %t A277593 z = 460; a[b_] := Table[Mod[n/b^IntegerExponent[n, b], b], {n, 1, z}] %t A277593 p[b_, d_] := Flatten[Position[a[b], d]] %t A277593 p[10, 1] (* A277588 *) %t A277593 p[10, 2] (* A277589 *) %t A277593 p[10, 3] (* A277590 *) %t A277593 p[10, 4] (* A277591 *) %t A277593 p[10, 5] (* A277592 *) %t A277593 p[10, 6] (* A277593 *) %t A277593 p[10, 7] (* A277594 *) %t A277593 p[10, 8] (* A277595 *) %t A277593 p[10, 9] (* A277596 *) %o A277593 (PARI) is(n)=n && n/10^valuation(n,10)%10==6 \\ _Charles R Greathouse IV_, Jan 31 2017 %Y A277593 Cf. A277588-A277592, A277594-A277596. %K A277593 nonn,easy,base %O A277593 1,1 %A A277593 _Clark Kimberling_, Nov 07 2016