cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A277570 #10 Feb 09 2021 01:54:55
%S A277570 4,10,16,22,24,28,34,40,46,52,58,60,64,70,76,82,88,94,96,100,106,112,
%T A277570 118,124,130,132,136,142,144,148,154,160,166,168,172,178,184,190,196,
%U A277570 202,204,208,214,220,226,232,238,240,244,250,256,262,268,274,276,280
%N A277570 Numbers k such that k/6^m == 4 (mod 6), where 6^m is the greatest power of 6 that divides k.
%C A277570 Positions of 4 in A277544.
%C A277570 Numbers having 4 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. Every term is even; see A277574.
%H A277570 Clark Kimberling, <a href="/A277570/b277570.txt">Table of n, a(n) for n = 1..10000</a>
%F A277570 a(n) = 5n + O(log n). - _Charles R Greathouse IV_, Nov 03 2016
%t A277570 z = 260; a[b_] := Table[Mod[n/b^IntegerExponent[n, b], b], {n, 1, z}]
%t A277570 p[b_, d_] := Flatten[Position[a[b], d]]
%t A277570 p[6, 1] (* A277567 *)
%t A277570 p[6, 2] (* A277568 *)
%t A277570 p[6, 3] (* A277569 *)
%t A277570 p[6, 4] (* A277570 *)
%t A277570 p[6, 5] (* A277571 *)
%o A277570 (PARI) is(n)=(n/6^valuation(n,6))%6==4 \\ _Charles R Greathouse IV_, Nov 03 2016
%Y A277570 Cf. A277544, A277567, A277571, A277574.
%K A277570 nonn,easy
%O A277570 1,1
%A A277570 _Clark Kimberling_, Nov 01 2016