cp's OEIS Frontend

A277594 Numbers k such that k/10^m == 7 mod 10, where 10^m is the greatest power of 10 that divides n.

%I A277594 #9 Jan 31 2017 00:58:51
%S A277594 7,17,27,37,47,57,67,70,77,87,97,107,117,127,137,147,157,167,170,177,
%T A277594 187,197,207,217,227,237,247,257,267,270,277,287,297,307,317,327,337,
%U A277594 347,357,367,370,377,387,397,407,417,427,437,447,457,467,470,477,487
%N A277594 Numbers k such that k/10^m == 7 mod 10, where 10^m is the greatest power of 10 that divides n.
%C A277594 Positions of 7 in A065881.
%C A277594 Numbers having 7 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 A277594 Clark Kimberling, <a href="/A277594/b277594.txt">Table of n, a(n) for n = 1..10000</a>
%t A277594 z = 460; a[b_] := Table[Mod[n/b^IntegerExponent[n, b], b], {n, 1, z}]
%t A277594 p[b_, d_] := Flatten[Position[a[b], d]]
%t A277594 p[10, 1] (* A277588 *)
%t A277594 p[10, 2] (* A277589 *)
%t A277594 p[10, 3] (* A277590 *)
%t A277594 p[10, 4] (* A277591 *)
%t A277594 p[10, 5] (* A277592 *)
%t A277594 p[10, 6] (* A277593 *)
%t A277594 p[10, 7] (* A277594 *)
%t A277594 p[10, 8] (* A277595 *)
%t A277594 p[10, 9] (* A277596 *)
%o A277594 (PARI) is(n)=n && n/10^valuation(n,10)%10==7 \\ _Charles R Greathouse IV_, Jan 31 2017
%Y A277594 Cf. A277588-A277593, A277595-A277596.
%K A277594 nonn,easy,base
%O A277594 1,1
%A A277594 _Clark Kimberling_, Nov 07 2016