id:A071147 - OEIS Search Results

Search: id:A071147

Displaying 1-1 of 1 results found.

page 1

Numbers n such that sum of distinct primes dividing n is divisible by the largest prime dividing n. Smallest square-free solutions with exactly n distinct prime-divisors. No solution exists for n=2, so a(2) is set to 0.

+0
8

1, 2, 0, 30, 3135, 3570, 72930, 1231230, 14804790, 497668710, 14908423530, 278196808890, 12192694624110, 550939666387110, 21275256232500270, 1458502323630662310, 87988283090327810190, 3254611619240885033130, 261462818462495728868790, 9965666894849284108299810, 557940830126698960967415390, 90544636506979071680577724410 (list; graph; listen)

	OFFSET	`0,2`
	FORMULA	`A008472(x)/A006530(x) is integer; x is squarefree and x has exactly n distinct prime factors.`
	EXAMPLE	`a(0)=1; a(1)=2; _; a(3)=2.3.5; a(4)=3.5.11.19; a(5)=2.3.5.7.17; a(6)=2.3.5.11.13.17; a(7)=2.3.5.7.11.13.41`
	CROSSREFS	`Cf. A008472, A006530, A000961, A025475, A037074, A071139-A071146.` `Sequence in context: A092177 A104466 A086487 this_sequence A009665 A053552 A009548` `Adjacent sequences: A071144 A071145 A071146 this_sequence A071148 A071149 A071150`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), May 13 2002`
	EXTENSIONS	`Corrected and extended by Donovan Johnson (donovan.johnson(AT)yahoo.com), Apr 22 2008`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research