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.

A358424 Numbers k such that A030717(k) = 6.

This page as a plain text file.
%I A358424 #10 Nov 19 2022 10:58:52
%S A358424 20,23,30,127,147,166,170,191,195,219,223,254,287,360,407,450,495,542,
%T A358424 590,592,643,644,645,699,700,759,760,762,821,822,824,886,887,889,955,
%U A358424 956,958,1027,1028,1030,1105,1106,1108,1188,1189,1191,1274,1275,1277,1362,1363,1365,1454,1455
%N A358424 Numbers k such that A030717(k) = 6.
%H A358424 Michael De Vlieger, <a href="/A358424/b358424.txt">Table of n, a(n) for n = 1..6070</a>
%H A358424 Michael De Vlieger, <a href="/A358424/a358424.png">Plot a(s(j) + k - 1) at (j,k)</a> for j = 1..512 and s = partial sums of A030719, showing a(m) = 6 in red, a(m) = 1 in medium blue for reference, and other values of a(m) in light blue.
%t A358424 nn = 40; m = 6; c[_] = 0; k = a[1] = c[1] = 1; Reap[Do[w = Union@ Array[a, k]; Do[Set[a[j + k], c[w[[j]]]]; If[a[j + k] == m, Sow[m]], {j, Length[w]}]; Do[c[a[j + k]]++, {j, Length[w]}]; k += Length[w], {n, nn}] ][[-1, -1]] (* _Michael De Vlieger_, Nov 19 2022 *)
%Y A358424 Cf. A030723, A030724, A030725, A030726, A358423, A358425.
%Y A358424 Cf. A030717.
%K A358424 nonn
%O A358424 1,1
%A A358424 _Seiichi Manyama_, Nov 15 2022