id:A054009 - OEIS Search Results

Search: id:A054009

Displaying 1-1 of 1 results found.

page 1

n read modulo (number of proper divisors of n).

+0
5

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

	OFFSET	`2,7`
	FORMULA	`a(n) = n mod (tau(n) - 1), for n>1`
	MAPLE	`[ seq( i mod (tau(i) - 1), i=2..150) ];`
	CROSSREFS	`Cf. A000005, A032741, A054008.` `Adjacent sequences: A054006 A054007 A054008 this_sequence A054010 A054011 A054012` `Sequence in context: A070821 A051632 A122821 this_sequence A091297 A035183 A054522`
	KEYWORD	`nonn`
	AUTHOR	`Asher Auel (asher.auel(AT)reed.edu) Jan 12, 2000`

page 1

Search completed in 0.002 seconds

Last modified October 12 15:26 EDT 2008. Contains 144830 sequences.

AT&T Labs Research