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.
%I A277567 #13 Sep 27 2023 12:28:29
%S A277567 1,6,7,13,19,25,31,36,37,42,43,49,55,61,67,73,78,79,85,91,97,103,109,
%T A277567 114,115,121,127,133,139,145,150,151,157,163,169,175,181,186,187,193,
%U A277567 199,205,211,216,217,222,223,229,235,241,247,252,253,258,259,265
%N A277567 Numbers k such that k/6^m == 1 (mod 6), where 6^m is the greatest power of 6 that divides k.
%C A277567 Positions of 1 in A277544. Numbers having 1 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 A277567 Clark Kimberling, <a href="/A277567/b277567.txt">Table of n, a(n) for n = 1..10000</a>
%F A277567 a(n) = 5n + O(log n). - _Charles R Greathouse IV_, Nov 03 2016
%t A277567 z = 260; a[b_] := Table[Mod[n/b^IntegerExponent[n, b], b], {n, 1, z}]
%t A277567 p[b_, d_] := Flatten[Position[a[b], d]]
%t A277567 p[6, 1] (* A277567 *)
%t A277567 p[6, 2] (* A277568 *)
%t A277567 p[6, 3] (* A277569 *)
%t A277567 p[6, 4] (* A277570 *)
%t A277567 p[6, 5] (* A277571 *)
%t A277567 Select[Range[300],Mod[#/6^IntegerExponent[#,6],6]==1&] (* _Harvey P. Dale_, Sep 27 2023 *)
%o A277567 (PARI) is(n)=(n/6^valuation(n,6))%6==1 \\ _Charles R Greathouse IV_, Nov 03 2016
%Y A277567 Cf. A277544, A277568, A277569.
%K A277567 nonn,easy
%O A277567 1,2
%A A277567 _Clark Kimberling_, Nov 01 2016