id:A067541 - OEIS Search Results

Search: id:A067541

Displaying 1-1 of 1 results found.

page 1

phi(n*(n+1)/2)/phi(n) where phi is the Euler totient function A000010(n).

+0
1

1, 2, 1, 2, 2, 6, 2, 3, 4, 10, 2, 6, 6, 8, 4, 8, 6, 18, 4, 6, 10, 22, 4, 10, 12, 18, 6, 14, 8, 30, 8, 10, 16, 24, 6, 18, 18, 24, 8, 20, 12, 42, 10, 12, 22, 46, 8, 21, 20, 32, 12, 26, 18, 40, 12, 18, 28, 58, 8, 30, 30, 36, 16, 24, 20, 66, 16, 22, 24, 70, 12, 36, 36, 40, 18, 30, 24 (list; graph; listen)

	OFFSET	`1,2`
	FORMULA	`Let n=2^k*l, GCD(l, 2)=1, then a(n)=phi((n+1)/2) if k=0, phi(n+1) if k=1 and phi(n+1)/2 if k>1. - Vladeta Jovovic (vladeta(AT)eunet.rs), Feb 06 2002`
	CROSSREFS	`Sequence in context: A004559 A095291 A093659 this_sequence A054706 A081727 A000020` `Adjacent sequences: A067538 A067539 A067540 this_sequence A067542 A067543 A067544`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 28 2002`

page 1

Search completed in 0.002 seconds

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.

AT&T Labs Research