id:A054008 - OEIS Search Results

Search: id:A054008

Displaying 1-1 of 1 results found.

page 1

n read modulo (number of divisors of n).

+0
2

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

	OFFSET	`1,6`
	COMMENT	`a(n)=0 iff n is a refactorable number (cf. A033950). - Franz Vrabec (franz.vrabec(AT)planetuniqa.at), Oct 16 2005`
	FORMULA	`a(n) = n mod tau(n)`
	MAPLE	`[ seq( i mod tau(i), i=1..130) ];`
	CROSSREFS	`Cf. A000005, A054009.` `Sequence in context: A112344 A123721 A085863 this_sequence A125676 A025874 A050326` `Adjacent sequences: A054005 A054006 A054007 this_sequence A054009 A054010 A054011`
	KEYWORD	`nonn`
	AUTHOR	`Asher Auel (asher.auel(AT)reed.edu) Jan 12, 2000`

page 1

Search completed in 0.002 seconds

Last modified September 6 16:04 EDT 2008. Contains 143483 sequences.

AT&T Labs Research