id:A007897 - OEIS Search Results

Search: id:A007897

Displaying 1-1 of 1 results found.

page 1

phi(n), where phi(n) is multiplicative with phi(2) = 1; phi(4) = 2; phi(2^a) = 2^(a-2)+2 if a>2; phi(p^a) = (p-1)*p^(a-1)/2 if prime p>2 and a>0.

+0
1

1, 1, 2, 2, 3, 2, 4, 4, 4, 3, 6, 4, 7, 4, 6, 6, 9, 4, 10, 6, 8, 6, 12, 8, 11, 7, 10, 8, 15, 6, 16, 10, 12, 9, 12, 8, 19, 10, 14, 12, 21, 8, 22, 12, 12, 12, 24, 12, 22, 11, 18, 14, 27, 10, 18, 16, 20, 15, 30, 12, 31, 16, 16, 18, 21, 12, 34, 18, 24, 12, 36, 16, 37, 19, 22, 20, 24, 14, 40, 18, 28 (list; graph; listen)

	OFFSET	`1,3`
	REFERENCES	`Felix Weinstein, The Fibonacci Partitions, preprint, 1995.`
	LINKS	`F. V. Weinstein, Notes on Fibonacci partitions`
	CROSSREFS	`Sequence in context: A164341 A124771 A066589 this_sequence A106289 A165418 A048620` `Adjacent sequences: A007894 A007895 A007896 this_sequence A007898 A007899 A007900`
	KEYWORD	`nonn,mult`
	AUTHOR	`Felix Weinstein [ wain(AT)ana.unibe.ch ]`

page 1

Search completed in 0.002 seconds

Last modified December 17 23:40 EST 2009. Contains 171025 sequences.

AT&T Labs Research