|
Search: id:A014950
|
|
|
| A014950 |
|
Numbers n such that n divides s(n), where s(1)=1, s(k)=s(k-1)+k*10^(k-1). |
|
+0
6
|
|
| 1, 3, 9, 27, 81, 111, 243, 333, 729, 999, 2187, 2997, 4107, 6561, 8991, 12321, 13203, 19683, 20439, 26973, 36963, 39609, 59049, 61317, 80919, 110889, 118827, 151959, 177147, 183951, 242757, 332667, 356481, 455877, 488511, 531441, 551853, 728271
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Also, n such that n | R(n)=A002275(n). - Lekraj Beedassy (blekraj(AT)yahoo.com), Mar 25 2005
If n is in the sequence then 3n is also in the sequence (the proof is easy). So since 1 is in the sequence 3^k for each k is in the sequence. It seems that except for the first term, 3 divides all terms. - Farideh Firoozbakht (mymontain(AT)yahoo.com), Oct 06 2006
|
|
REFERENCES
|
J. D. E. Konhauser et al., Which Way Did The Bicycle Go? Problem 80 pp. 26; 133 Dolciani Math. Exp. No. 18 MAA Washington DC 1996.
C. Cooper & R. E. Kennedy, "Niven Repunits and 10^n = 1 (mod n)" in 'The Fibonacci Quarterly' pp. 139-143 vol 27.2 May 1989, The Fibonacci Association,Aurora SD.
|
|
FORMULA
|
Solutions to 10^n=1 (mod n). - Vladeta Jovovic
|
|
CROSSREFS
|
Cf. A122787.
Sequence in context: A057262 A057232 A036145 this_sequence A036143 A006521 A014953
Adjacent sequences: A014947 A014948 A014949 this_sequence A014951 A014952 A014953
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Olivier Gerard (olivier.gerard(AT)gmail.com)
|
|
EXTENSIONS
|
More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Dec 18 2001
More terms from Larry Reeves (larryr(AT)acm.org), Jan 06 2005
|
|
|
Search completed in 0.002 seconds
|
