|
Search: id:A011772
|
|
|
| A011772 |
|
Smallest number m such that m(m+1)/2 is divisible by n. |
|
+0
9
|
|
| 1, 3, 2, 7, 4, 3, 6, 15, 8, 4, 10, 8, 12, 7, 5, 31, 16, 8, 18, 15, 6, 11, 22, 15, 24, 12, 26, 7, 28, 15, 30, 63, 11, 16, 14, 8, 36, 19, 12, 15, 40, 20, 42, 32, 9, 23, 46, 32, 48, 24, 17, 39, 52, 27, 10, 48, 18, 28, 58, 15, 60, 31, 27, 127, 25, 11, 66, 16, 23, 20, 70, 63, 72, 36, 24
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Also called pseudo-Smarandache numbers.
a(2^k) = 2^(k+1)-1; a(m)=m-1 and for odd prime powers m; - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Feb 26 2003
|
|
REFERENCES
|
C. Ashbacher, The Pseudo-Smarandache Function and the Classical Functions of Number Theory, Smarandache Notions Journal, Vol. 9, No. 1-2, 1998, 79-82.
K. Kashihara, Comments and Topics on Smarandache Notions and Problems, Erhus University Press, 1996.
K. Kashihara, Comments and Topics on Smarandache Notions and Problems, Erhus Univ. Press, 1996.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..1000
M. L. Perez et al., eds., Smarandache Notions Journal
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
K. Kashihara, Comments and Topics on Smarandache Notions and Problems.
|
|
FORMULA
|
a(n) <= 2n-1 for all numbers n; a(n) <= n-1 for odd n - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Apr 03 2006
|
|
MATHEMATICA
|
Table[m := 1; While[Not[IntegerQ[(m*(m + 1))/(2n)]], m++ ]; m, {n, 1, 90}] - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Apr 03 2006
|
|
CROSSREFS
|
A066561(n)=A000217(a(n)).
Cf. A080982.
Adjacent sequences: A011769 A011770 A011771 this_sequence A011773 A011774 A011775
Sequence in context: A057020 A075270 A067872 this_sequence A060451 A129187 A135542
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
Kenichiro Kashihara (Univxiq(AT)aol.com)
|
|
EXTENSIONS
|
More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Apr 03 2006
|
|
|
Search completed in 0.002 seconds
|
