The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A212918 Numbers whose sum of prime factors (counted with multiplicity) is a pentagonal number (A000326). 1
1, 5, 6, 35, 42, 50, 57, 60, 64, 72, 81, 85, 102, 121, 124, 182, 188, 201, 232, 260, 261, 267, 308, 312, 351, 440, 452, 495, 519, 528, 594, 645, 649, 688, 735, 741, 774, 784, 805, 854, 861, 875, 882, 901, 966, 1025, 1027, 1045, 1050, 1081, 1105, 1112, 1119 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
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.
LINKS
FORMULA
{k such that A001414(k) = sopfr(k) is in A000326(j) = j*(3*j-1)/2 for some integer j}.
EXAMPLE
a(3) = 35 because sopfr(35) = sum of prime factors of 35 = 5 + 7 = 12, and 12 is the 3rd pentagonal number.
MATHEMATICA
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 *)
PROG
(PARI) sopfr(n) = my(f=factor(n)); sum(k=1, matsize(f)[1], f[k, 1]*f[k, 2]); \\ A001414
isok(n) = ispolygonal(sopfr(n), 5); \\ Michel Marcus, May 02 2018
CROSSREFS
Sequence in context: A151506 A122008 A248254 * A255197 A253192 A036254
KEYWORD
nonn,easy
AUTHOR
Jonathan Vos Post, May 31 2012
EXTENSIONS
Corrected by T. D. Noe, May 31 2012
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 4 22:04 EDT 2024. Contains 373102 sequences. (Running on oeis4.)