|
Search: id:A054767
|
|
| |
|
| 1, 3, 13, 12, 781, 39, 137257, 24, 39, 2343, 28531167061, 156, 25239592216021, 411771, 10153, 48, 51702516367896047761, 117, 109912203092239643840221, 9372, 1784341, 85593501183
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
For p prime, a(p) divides (p^p-1)/(p-1) = A023037(p), with equality at least for p up to 19.
|
|
REFERENCES
|
J. Levine and R. E. Dalton, Minimum Periods, Modulo p, of First Order Bell Exponential Integrals, Mathematics of Computation, 16 (1962), 416-423.
|
|
LINKS
|
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
|
|
FORMULA
|
If gcd(n,m) = 1, a(n*m) = lcm(a(n), a(m)). But the sequence is not in general multiplicative; e.g. a(2) = 3, a(9) = 39, and a(18) = 39. - Frank Adams-Watters (FrankTAW(AT)Netscape.net), Jun 06 2006
|
|
CROSSREFS
|
Cf. A000110, A023037.
Sequence in context: A066674 A121565 A107733 this_sequence A137947 A076747 A043055
Adjacent sequences: A054764 A054765 A054766 this_sequence A054768 A054769 A054770
|
|
KEYWORD
|
nonn,hard,more,nice
|
|
AUTHOR
|
Eric Weisstein (eric(AT)weisstein.com), Feb 09, 2002
|
|
EXTENSIONS
|
More information from Phil Carmody (pc+oeis(AT)asdf.org), Dec 22 2002
|
|
|
Search completed in 0.002 seconds
|
