id:A055470 - OEIS Search Results

Search: id:A055470

Displaying 1-1 of 1 results found.

page 1

Smallest composite number x>1 such that Phi[x]+Sigma[x] = k*d[x]^n, i.e. the left-hand side is divisible by the n-th power of the number of divisors.

+0
1

2, 2, 95, 121, 121, 2047, 49151, 98303, 393215, 1572863, 6291455, 8388607, 201326591, 805306367, 3221225471 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`It appears that for n>5, a(n) is a semiprime. - Lambert Klasen (Lambert.Klasen(AT)gmx.net), Aug 22 2005`
	FORMULA	`Least integer x>1 such that A000010[x]+A000203[x] = k*A000005[x]^n`
	EXAMPLE	`The terms of list {2,2,95,121,121,2047,49151,98303} have {2,2,4,3,3,4,4,4} divisors, {3,3,120,133,133,2160,51312,99000} divisor-sums, {1,1,72,110,110,1936,46992,97608} EulerPhi values. The Phi+Sigma Sums are {4,4,192,243,243,4096,98304,196608}, which are divided by {2,4,64,81,243,4096,16384,65536} increasing powers of d-numbers, giving {2,1,3,3,1,1,6,3} quotients respectively.`
	PROGRAM	`(PARI) k=2; for(n=1, 15, while(denominator((sigma(k)+eulerphi(k))/(sigma(k, 0)^n))!=1, k++); \ print(n, " ", k)) (Klasen)`
	CROSSREFS	`Cf. A000203, A000010, A000005.` `Sequence in context: A156523 A156511 A133295 this_sequence A156524 A003110 A100956` `Adjacent sequences: A055467 A055468 A055469 this_sequence A055471 A055472 A055473`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Jun 27 2000`
	EXTENSIONS	`More terms from Jud McCranie (j.mccranie(AT)comcast.net), Oct 08 2000` `More terms from Lambert Klasen (Lambert.Klasen(AT)gmx.net), Aug 22 2005`

page 1

Search completed in 0.002 seconds

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