login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A277571 Numbers k such that k/6^m == 5 (mod 6), where 6^m is the greatest power of 6 that divides k. 5

%I #11 Feb 09 2021 01:54:59

%S 5,11,17,23,29,30,35,41,47,53,59,65,66,71,77,83,89,95,101,102,107,113,

%T 119,125,131,137,138,143,149,155,161,167,173,174,179,180,185,191,197,

%U 203,209,210,215,221,227,233,239,245,246,251,257,263,269,275,281

%N Numbers k such that k/6^m == 5 (mod 6), where 6^m is the greatest power of 6 that divides k.

%C Positions of 5 in A277544.

%C Numbers having 5 as rightmost nonzero digit in base 6. This is one sequence in a 5-way splitting of the positive integers; the other four are indicated in the Mathematica program.

%H Clark Kimberling, <a href="/A277571/b277571.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) = 5n + O(log n). - _Charles R Greathouse IV_, Nov 03 2016

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

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

%t p[6, 1] (* A277567 *)

%t p[6, 2] (* A277568 *)

%t p[6, 3] (* A277569 *)

%t p[6, 4] (* A277570 *)

%t p[6, 5] (* A277571 *)

%o (PARI) is(n) = Mod(n/6^valuation(n, 6), 6)==5 \\ _Felix Fröhlich_, Nov 02 2016

%Y Cf. A277544, A277567, A277570.

%K nonn,easy

%O 1,1

%A _Clark Kimberling_, Nov 01 2016

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 14 16:54 EDT 2024. Contains 375166 sequences. (Running on oeis4.)