id:A062362 - OEIS Search Results

Search: id:A062362

Displaying 1-1 of 1 results found.

page 1

Numbers n such that floor of Sum_{ d divides n } phi(d)/d.

+0
1

1, 1, 1, 2, 1, 2, 1, 2, 2, 2, 1, 3, 1, 2, 3, 3, 1, 3, 1, 3, 3, 2, 1, 4, 2, 2, 3, 3, 1, 4, 1, 3, 3, 2, 3, 4, 1, 2, 3, 4, 1, 4, 1, 3, 4, 2, 1, 5, 2, 3, 3, 3, 1, 4, 3, 4, 3, 2, 1, 6, 1, 2, 4, 4, 3, 4, 1, 3, 3, 5, 1, 5, 1, 2, 4, 3, 3, 4, 1, 5, 3, 2, 1, 6, 3, 2, 3, 4, 1, 6, 3, 3, 3, 2, 3, 5, 1, 4, 4, 5, 1, 4, 1, 4, 5 (list; graph; listen)

	OFFSET	`1,4`
	REFERENCES	`D. M. Burton, Elementary Number Theory, Allyn and Bacon Inc. Boston, MA, 1976, p. 152.`
	PROGRAM	`(PARI) j=[]; for(n=1, 250, j=concat(j, floor(sumdiv(n, d, eulerphi(d)/d)))); j`
	CROSSREFS	`Sequence in context: A038548 A068108 A113309 this_sequence A084113 A115751 A048684` `Adjacent sequences: A062359 A062360 A062361 this_sequence A062363 A062364 A062365`
	KEYWORD	`easy,nonn`
	AUTHOR	`Jason Earls (zevi_35711(AT)yahoo.com), Jul 07 2001`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research