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 A353568 #12 May 20 2022 08:56:51
%S A353568 1,3,4,5,6,10,9,14,15,22,20,21,26,28,33,30,35,44,39,42,55,52,51,66,65,
%T A353568 68,70,57,78,85,110,102,95,130,114,170,138,182,220,190,174,238,260,
%U A353568 230,255,266,340,290,276,285,322,380,310,418,345,476,406,460,370,510,506,435,532,434,580,483,570,638,465,644,518
%N A353568 Prime shadows of (nonzero) K-champion numbers.
%C A353568 Sequence is injective (no duplicate values occur) because A307866 (after its initial zero) is a subsequence of A025487.
%C A353568 The finite number of powerful (A001694) terms in A307866 implies a finite number of odd terms in this sequence.
%H A353568 Amiram Eldar, <a href="/A353568/b353568.txt">Table of n, a(n) for n = 1..883</a>
%F A353568 a(n) = A181819(A307866(1+n)).
%F A353568 a(n) = A122111(A330686(n)).
%o A353568 (PARI)
%o A353568 v307866 = readvec("b307866_to.txt";) \\ Prepared from the b-file of A307866 with gawk ' { print $2 } ' < b307866.txt > b307866_to.txt
%o A353568 A307866(n) = v307866[n];
%o A353568 A181819(n) = factorback(apply(e->prime(e),(factor(n)[,2])));
%o A353568 A353568(n) = A181819(A307866(1+n));
%Y A353568 Cf. A025487, A122111, A181819, A307866, A330686.
%Y A353568 Cf. also A353561, A353562.
%K A353568 nonn
%O A353568 1,2
%A A353568 _Antti Karttunen_, Apr 29 2022