login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A277590 Numbers k such that k/10^m == 3 mod 10, where 10^m is the greatest power of 10 that divides n. 9
3, 13, 23, 30, 33, 43, 53, 63, 73, 83, 93, 103, 113, 123, 130, 133, 143, 153, 163, 173, 183, 193, 203, 213, 223, 230, 233, 243, 253, 263, 273, 283, 293, 300, 303, 313, 323, 330, 333, 343, 353, 363, 373, 383, 393, 403, 413, 423, 430, 433, 443, 453, 463, 473 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Positions of 3 in A065881.

Numbers having 3 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.

LINKS

Clark Kimberling, Table of n, a(n) for n = 1..10000

MATHEMATICA

z = 460; a[b_] := Table[Mod[n/b^IntegerExponent[n, b], b], {n, 1, z}]

p[b_, d_] := Flatten[Position[a[b], d]]

p[10, 1] (* A277588 *)

p[10, 2] (* A277589 *)

p[10, 3] (* A277590 *)

p[10, 4] (* A277591 *)

p[10, 5] (* A277592 *)

p[10, 6] (* A277593 *)

p[10, 7] (* A277594 *)

p[10, 8] (* A277595 *)

p[10, 9] (* A277596 *)

PROG

(PARI) is(n)=n && n/10^valuation(n, 10)%10==3 \\ Charles R Greathouse IV, Jan 31 2017

CROSSREFS

Cf. A277588, A277589, A277591-A277596.

Sequence in context: A011533 A277965 A043501 * A062667 A212525 A106099

Adjacent sequences:  A277587 A277588 A277589 * A277591 A277592 A277593

KEYWORD

nonn,easy,base

AUTHOR

Clark Kimberling, Nov 05 2016

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 21 20:03 EDT 2019. Contains 322328 sequences. (Running on oeis4.)