login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A132705
For an integer n with prime factorization (p_1)*(p_2)*(p_3)* ... *(p_k), a(n) = (p_1+2)*(p_2+2)*(p_3+2)* ... *(p_k+2).
0
2, 3, 4, 5, 16, 7, 20, 9, 64, 25, 28, 13, 80, 15, 36, 35, 256, 19, 100, 21, 112, 45, 52, 25, 320, 49, 60, 125, 144, 31, 140, 33, 128, 65, 76, 63, 400, 49, 84, 75, 448, 43, 180, 45, 208, 175, 100, 49, 1280, 81, 196, 95, 240, 55, 500, 91, 576, 105, 124, 60
OFFSET
0,1
COMMENTS
a(0)=2 and a(1)=3 by convention. For an integer n with prime factorization prime(i_1)*prime(i_2)*prime(i_3)* ... *prime(i_k), a(n) = A052147(i_1)*A052147(i_2)*A052147(i_3)* ... *A052147(i_k). This sequence is to p+2 as A064478 is to p+1 for primes p.
If a(1) were 1 rather than 3, the sequence would be completely multiplicative with a(p) = p + 2. - Charles R Greathouse IV, Sep 02 2009
KEYWORD
easy,nonn
AUTHOR
Jonathan Vos Post, Nov 16 2007
STATUS
approved