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 A212918 #11 May 02 2018 09:27:51
%S A212918 1,5,6,35,42,50,57,60,64,72,81,85,102,121,124,182,188,201,232,260,261,
%T A212918 267,308,312,351,440,452,495,519,528,594,645,649,688,735,741,774,784,
%U A212918 805,854,861,875,882,901,966,1025,1027,1045,1050,1081,1105,1112,1119
%N A212918 Numbers whose sum of prime factors (counted with multiplicity) is a pentagonal number (A000326).
%C A212918 This is to pentagonal numbers A000326 as A000290 squares are to A212831 numbers whose sum of prime factors is a square (counted with multiplicity) and as A000217 triangular numbers are to A212849 Numbers whose sum of prime factors (counted with multiplicity) is a triangular number.
%H A212918 G. C. Greubel, <a href="/A212918/b212918.txt">Table of n, a(n) for n = 1..5000</a>
%F A212918 {k such that A001414(k) = sopfr(k) is in A000326(j) = j*(3*j-1)/2 for some integer j}.
%e A212918 a(3) = 35 because sopfr(35) = sum of prime factors of 35 = 5 + 7 = 12, and 12 is the 3rd pentagonal number.
%t A212918 pentagonalQ[n_] := IntegerQ[(1 + Sqrt[1 + 24*n])/6]; pfs[n_] := Module[{p, e}, {p, e} = Transpose[FactorInteger[n]]; Dot[p, e]]; Select[Range[1500], pentagonalQ[pfs[#]] &] (* _T. D. Noe_, May 31 2012 *)
%o A212918 (PARI) sopfr(n) = my(f=factor(n)); sum(k=1, matsize(f)[1], f[k, 1]*f[k, 2]); \\ A001414
%o A212918 isok(n) = ispolygonal(sopfr(n), 5); \\ _Michel Marcus_, May 02 2018
%Y A212918 Cf. A000326, A001414, A212831, A212849.
%K A212918 nonn,easy
%O A212918 1,2
%A A212918 _Jonathan Vos Post_, May 31 2012
%E A212918 Corrected by _T. D. Noe_, May 31 2012