id:A063444 - OEIS Search Results

Search: id:A063444

Displaying 1-1 of 1 results found.

page 1

Smallest number such that GCD of EulerPhi of 2 consecutive integer equals 2n.

+0
2

3, 12, 13, 15, 121, 35, 86, 64, 37, 99, 726, 72, 158, 196, 61, 96, 4931, 73, 7639, 175, 343, 267, 2302, 104, 250, 676, 162, 637, 3481, 154, 21142, 192, 2178, 411, 5041, 814, 446, 1145, 157, 164, 6971, 1348, 14878, 1334, 542, 2115, 22090, 193, 2842, 2200 (list; graph; listen)

	OFFSET	`1,1`
	FORMULA	`Min{x; GCD[Phi[x+1], Phi[x]]=2n}=Min{x; A058515[x]=2n}`
	EXAMPLE	`n = 10, a(10) = 99, Phi(99) = 60, Phi(100) = 40, GCD[60,40] = 2n = 20.`
	CROSSREFS	`A000010, A058515.` `Adjacent sequences: A063441 A063442 A063443 this_sequence A063445 A063446 A063447` `Sequence in context: A085060 A024546 A073542 this_sequence A117061 A089919 A032918`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Jul 24 2001`

page 1

Search completed in 0.002 seconds

Last modified October 13 20:18 EDT 2008. Contains 145016 sequences.

AT&T Labs Research