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 A136568 #19 Aug 04 2024 03:01:17 %S A136568 0,1,1,2,1,1,1,3,2,1,1,1,2,1,1,1,4,1,1,2,1,1,2,1,1,1,1,3,2,1,3,1,2,1, %T A136568 1,1,5,1,1,1,2,1,1,1,1,3,1,1,1,1,2,1,2,1,1,1,4,2,1,2,1,1,2,1,1,3,1,1, %U A136568 3,1,1,1,1,2,1,1,1,2,6,1,1,1,1,2,1,1 %N A136568 Irregular triangle read by rows: row n contains the distinct values (in numerical order) making up the nonzero exponents in the prime factorization of n. (Row 1 = (0).). %C A136568 Row n, for n>=2, contains A071625(n) terms. %H A136568 Harvey P. Dale, <a href="/A136568/b136568.txt">Table of n, a(n) for n = 1..1000</a> %H A136568 <a href="/index/Pri#prime_signature">Index to sequences related to prime signature</a>. %e A136568 4200 = 2^3 * 3^1 * 5^2 * 7^1. The exponents of the prime factorization are therefore 3,1,2,1. Therefore row 4200 is (1,2,3). %e A136568 Table begins: %e A136568 0; %e A136568 1; %e A136568 1; %e A136568 2; %e A136568 1; %e A136568 1; %e A136568 1; %e A136568 3; %e A136568 2; %e A136568 1; %e A136568 1; %e A136568 1, 2; %t A136568 Join[{0},Flatten[Rest[Table[Union[Transpose[FactorInteger[n]][[2]]],{n,100}]]]] (* _Harvey P. Dale_, Mar 19 2013 *) %o A136568 (PARI) row(n) = if(n == 1, [0], Set(factor(n)[,2])); \\ _Amiram Eldar_, Aug 04 2024 %Y A136568 Cf. A071625, A136565. %K A136568 nonn,tabf %O A136568 1,4 %A A136568 _Leroy Quet_, Jan 07 2008 %E A136568 More terms from _Harvey P. Dale_, Mar 19 2013