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 A254269 #17 Feb 16 2025 08:33:24
%S A254269 1,1,1,2,2,3,2,5,3,2,5,3,5,3,11,3,2,19,23,3,2,19,89,13,61,71,11,3,37,
%T A254269 2,37,17,13,7,2,13,167,19,3,491,53,7,31,23,227,2,3,37,97,17,59,241,79,
%U A254269 5,953,1063,1777,29,367,17,17,3019,181,29,4111
%N A254269 Largest prime factor of the strict partition numbers Q(n) (partitions into distinct parts, A000009).
%C A254269 A035359 is the sequence of indices n such that a(n) = A000009(n).
%H A254269 Jean-François Alcover and Giovanni Resta, <a href="/A254269/b254269.txt">Table of n, a(n) for n = 0..10000</a> (first 1001 terms from Jean-François Alcover)
%H A254269 Eric Weisstein's MathWorld, <a href="https://mathworld.wolfram.com/PartitionFunctionQ.html">Partition Function Q</a>
%t A254269 Table[FactorInteger[PartitionsQ[n]][[-1, 1]], {n, 0, 100}]
%Y A254269 Cf. A000009, A035359, A071963.
%K A254269 nonn
%O A254269 0,4
%A A254269 _Jean-François Alcover_, Jan 27 2015