|
Search: id:A138761
|
|
|
| A138761 |
|
a(n) is the smallest member of A000522 divisible by 2^n, where A000522(m) = total number of arrangements of a set with m elements. |
|
+0
3
|
|
| 1, 2, 16, 16, 16, 330665665962404000, 4216377920843140187197325631474390438452208808916276571342090223552, 79512290335622167198968658348303019006598782717159485273073341783776447436021935\ 12560632886667046956871028660084960141527665502645669528502187522191141407814004\ 52987113610891553002103768576
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
a(n) < A000522(2^n) for n > 0; see Sondow and Schalm, Proposition A.13 part (ii).
|
|
REFERENCES
|
J. Sondow and K. Schalm, Which Partial Sums of the Taylor Series for e are Convergents to e? (and a Link to the Primes 2, 5, 13, 37, 463) (preprint 2007), to appear in Tapas in Experimental Mathematics, T. Amdeberhan and V. Moll, eds., Contemporary Mathematics
|
|
LINKS
|
J. Sondow and K. Schalm, Which Partial Sums of the Taylor Series for e are Convergents to e? (and a Link to the Primes 2, 5, 13, 37, 463)
Index entries for sequences related to factorial numbers
|
|
FORMULA
|
a(n) = A000522(A127014(n)) = Sum_{k=0...A127014(n)} A127014(n)!/k! for n > 0.
|
|
EXAMPLE
|
a(5) = A000522(19) = 330665665962404000 because that is the smallest member of A000522 divisible by 2^5.
|
|
CROSSREFS
|
Cf. A000522, A127014, A127015.
Sequence in context: A110008 A110875 A066773 this_sequence A075376 A032935 A004831
Adjacent sequences: A138758 A138759 A138760 this_sequence A138762 A138763 A138764
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Jonathan Sondow (jsondow(AT)alumni.princeton.edu), Apr 01 2008
|
|
|
Search completed in 0.002 seconds
|
