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”).
%I #14 Jan 31 2017 01:00:39
%S 1,10,11,21,31,41,51,61,71,81,91,100,101,110,111,121,131,141,151,161,
%T 171,181,191,201,210,211,221,231,241,251,261,271,281,291,301,310,311,
%U 321,331,341,351,361,371,381,391,401,410,411,421,431,441,451,461,471
%N Numbers k such that k/10^m == 1 mod 10, where 10^m is the greatest power of 10 that divides n.
%C Positions of 1 in A065881.
%C Numbers having 1 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 Clark Kimberling, <a href="/A277588/b277588.txt">Table of n, a(n) for n = 1..10000</a>
%p M:= 4: # to get all terms with <= M digits
%p A:= sort([seq(seq(10^d*(10*x+1),x=0..10^(M-1-d)-1),d=0..M-2)]); # _Robert Israel_, Nov 07 2016
%t z = 460; a[b_] := Table[Mod[n/b^IntegerExponent[n, b], b], {n, 1, z}]
%t p[b_, d_] := Flatten[Position[a[b], d]]
%t p[10, 1] (* A277588 *)
%t p[10, 2] (* A277589 *)
%t p[10, 3] (* A277590 *)
%t p[10, 4] (* A277591 *)
%t p[10, 5] (* A277592 *)
%t p[10, 6] (* A277593 *)
%t p[10, 7] (* A277594 *)
%t p[10, 8] (* A277595 *)
%t p[10, 9] (* A277596 *)
%t f[n_] := Block[{m = n}, While[ Mod[m, 10] == 0, m /= 10]; Mod[m, 10]]; Flatten@ Position[ Array[f, 500], 1] (* _Robert G. Wilson v_, Nov 06 2016 *)
%o (PARI) is(n)=n && n/10^valuation(n,10)%10==1 \\ _Charles R Greathouse IV_, Jan 31 2017
%Y Cf. A277589-A277596.
%K nonn,easy,base
%O 1,2
%A _Clark Kimberling_, Nov 05 2016