id:A099679 - OEIS Search Results

Search: id:A099679

Displaying 1-1 of 1 results found.

page 1

Least m such that repunit R_m is a multiple of A045572(n) (i.e. odd numbers not divisible by 5).

+0
2

1, 3, 6, 9, 2, 6, 16, 18, 6, 22, 27, 28, 15, 6, 3, 6, 5, 21, 46, 42, 48, 13, 18, 58, 60, 18, 33, 66, 35, 8, 6, 13, 81, 41, 84, 44, 6, 15, 96, 18, 4, 34, 53, 108, 3, 112, 18, 48, 22, 15, 42, 21, 130, 18, 8, 46, 138, 6, 42, 148, 75, 144, 78, 39, 66, 81, 166, 78, 18, 43, 174, 178 (list; graph; listen)

	OFFSET	`1,2`
	LINKS	`P. de Geest, Repunits and their prime factors` `T. Granlund, Factors of 10^n - 1` `M. Kamada, Factorizations of 11...11(Repunits)` `Y. Koide, Factorization of Repunit Numbers` `P. Yiu, Factorization of Repunits R_n for n=<50, Appendix Chap. 18.5 pp. 173/360 in 'Recreational Mathematics'.`
	MATHEMATICA	`f[n_] := Block[{k = 1}, While[ Mod[(10^k - 1)/9, n] != 0, k++ ]; k]; f /@ Select[ 2Range[ 90] - 1, Mod[ #, 5] != 0 &] (from Robert G. Wilson v Oct 27 2004)`
	CROSSREFS	`Cf. A002275, A045572.` `Sequence in context: A131579 A059626 A094561 this_sequence A013663 A086276 A020850` `Adjacent sequences: A099676 A099677 A099678 this_sequence A099680 A099681 A099682`
	KEYWORD	`nonn`
	AUTHOR	`Lekraj Beedassy (blekraj(AT)yahoo.com), Oct 26 2004`
	EXTENSIONS	`Corrected and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Oct 27 2004`

page 1

Search completed in 0.002 seconds

Last modified November 21 14:49 EST 2008. Contains 150807 sequences.

AT&T Labs Research