id:A132705 - OEIS Search Results

Search: id:A132705

Displaying 1-1 of 1 results found.

page 1

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
1

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 (list; graph; listen)

	OFFSET	`0,1`
	COMMENT	`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.`
	CROSSREFS	`Cf. A000040, A003958, A003959, A064476, A064479, A052147, A064478.` `Sequence in context: A096774 A102738 A098553 this_sequence A004834 A075687 A095181` `Adjacent sequences: A132702 A132703 A132704 this_sequence A132706 A132707 A132708`
	KEYWORD	`mult,easy,nonn`
	AUTHOR	`Jonathan Vos Post (jvospost2(AT)yahoo.com), Nov 16 2007`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research