id:A045965 - OEIS Search Results

Search: id:A045965

Displaying 1-1 of 1 results found.

page 1

a(1)=2; if n = Product p_i^e_i, n>1, then a(n) = Product p_{i+1}^e_i.

+0
5

2, 3, 5, 9, 7, 15, 11, 27, 25, 21, 13, 45, 17, 33, 35, 81, 19, 75, 23, 63, 55, 39, 29, 135, 49, 51, 125, 99, 31, 105, 37, 243, 65, 57, 77, 225, 41, 69, 85, 189, 43, 165, 47, 117, 175, 87, 53, 405, 121, 147, 95, 153, 59, 375, 91, 297, 115, 93, 61, 315, 67, 111, 275, 729, 119 (list; graph; listen)

	OFFSET	`1,1`
	REFERENCES	`From a puzzle proposed by Marc LeBrun (mlb(AT)well.com).`
	MAPLE	`succfactorization := proc(n) local p, d; if(1 = n) then RETURN(2); fi; p := 1; for d in ifactors(n)[ 2 ] do p := p * (nextprime(d[ 1 ])^d[ 2 ]); od; RETURN(p); end;`
	CROSSREFS	`Cf. A048673. Essentially identical to A003961.` `Sequence in context: A011026 A069805 A123923 this_sequence A100674 A058314 A072735` `Adjacent sequences: A045962 A045963 A045964 this_sequence A045966 A045967 A045968`
	KEYWORD	`easy,nonn,nice`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`
	EXTENSIONS	`More terms from David W. Wilson (davidwwilson(AT)comcast.net).`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research