id:A084680 - OEIS Search Results

Search: id:A084680

Displaying 1-1 of 1 results found.

page 1

Order of 10 modulo n [i.e. least m such that 10^m = 1 (mod n)] or 0 when no such number exists.

+0
2

1, 0, 1, 0, 0, 0, 6, 0, 1, 0, 2, 0, 6, 0, 0, 0, 16, 0, 18, 0, 6, 0, 22, 0, 0, 0, 3, 0, 28, 0, 15, 0, 2, 0, 0, 0, 3, 0, 6, 0, 5, 0, 21, 0, 0, 0, 46, 0, 42, 0, 16, 0, 13, 0, 0, 0, 18, 0, 58, 0, 60, 0, 6, 0, 0, 0, 33, 0, 22, 0, 35, 0, 8, 0, 0, 0, 6, 0, 13, 0, 9, 0, 41, 0, 0, 0, 28, 0, 44, 0, 6, 0, 15, 0, 0, 0 (list; graph; listen)

	OFFSET	`1,7`
	COMMENT	`When n is not divisible by 2 or 5, a(n) = A007732(n). A002329 contains the nonzero terms.` `A number k>0 appears in this sequence exactly A059892(k) times. - T. D. Noe, May 18 2007` `A number k>0 appears in this sequence exactly A059892(k) times. - T. D. Noe (noe(AT)sspectra.com), May 18 2007`
	LINKS	`T. D. Noe, Table of n, a(n) for n=1..1000`
	CROSSREFS	`Cf. A007732, A002329.` `Sequence in context: A101109 A060297 A137378 this_sequence A051626 A137785 A134899` `Adjacent sequences: A084677 A084678 A084679 this_sequence A084681 A084682 A084683`
	KEYWORD	`nonn`
	AUTHOR	`Lekraj Beedassy (blekraj(AT)yahoo.com), Jun 30 2003`
	EXTENSIONS	`More terms from John W. Layman (layman(AT)math.vt.edu), Aug 12 2003`

page 1

Search completed in 0.002 seconds

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.

AT&T Labs Research