id:A053590 - OEIS Search Results

Search: id:A053590

Displaying 1-1 of 1 results found.

page 1

Consider any chain of consecutive primes which divides n; take all longest such chains; maximize the product of the primes in the chain.

+0
1

1, 2, 3, 2, 5, 6, 7, 2, 3, 2, 11, 6, 13, 2, 15, 2, 17, 6, 19, 2, 3, 2, 23, 6, 5, 2, 3, 2, 29, 30, 31, 2, 3, 2, 35, 6, 37, 2, 3, 2, 41, 6, 43, 2, 15, 2, 47, 6, 7, 2, 3, 2, 53, 6, 5, 2, 3, 2, 59, 30, 61, 2, 3, 2, 5, 6, 67, 2, 3, 7, 71, 6, 73, 2, 15, 2, 77, 6, 79, 2, 3, 2, 83, 6, 5, 2, 3, 2, 89, 30 (list; graph; listen)

	OFFSET	`1,2`
	EXAMPLE	`a(462)=77 because 462=23711 and so the greatest product of the longest chain is 711=35.`
	CROSSREFS	`Sequence in context: A086184 A056552 A049273 this_sequence A086297 A056554 A088835` `Adjacent sequences: A053587 A053588 A053589 this_sequence A053591 A053592 A053593`
	KEYWORD	`nice,nonn,easy`
	AUTHOR	`Frederick Magata (fmagata(AT)mi.uni-koeln.de), Jan 19 2000`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research