%I #8 Jan 31 2017 00:58:15
%S 9,19,29,39,49,59,69,79,89,90,99,109,119,129,139,149,159,169,179,189,
%T 190,199,209,219,229,239,249,259,269,279,289,290,299,309,319,329,339,
%U 349,359,369,379,389,390,399,409,419,429,439,449,459,469,479,489,490
%N Numbers k such that k/10^m == 9 mod 10, where 10^m is the greatest power of 10 that divides n.
%C Positions of 9 in A065881.
%C Numbers having 9 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="/A277596/b277596.txt">Table of n, a(n) for n = 1..10000</a>
%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 *)
%o (PARI) is(n)=n && n/10^valuation(n,10)%10==9 \\ _Charles R Greathouse IV_, Jan 31 2017
%Y Cf. A277588-A277595.
%K nonn,easy,base
%O 1,1
%A _Clark Kimberling_, Nov 07 2016