login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A003091 a(n) = floor( 2^(n*(n-1)/2) / n! ).
(Formerly M1870)
1
1, 1, 1, 2, 8, 45, 416, 6657, 189372, 9695869, 902597327, 154043277297, 48535481831642, 28400190511772276, 31020581422991798557, 63530150754287203445810, 244912468225468597942626507, 1783398168624923337196441201196, 24605638395579573858211783276124626 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
REFERENCES
F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 1973, p. 246.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
FORMULA
a(n) = floor( 2^binomial(n,2) / n! ).
MAPLE
A003091:n->floor(2^(n*(n-1)/2)/n!);
MATHEMATICA
Table[Floor[2^(n*(n-1)/2)/n!], {n, 30}] (* G. C. Greubel, Nov 02 2022 *)
PROG
(Magma) [Floor(2^Binomial(n, 2)/Factorial(n)): n in [1..30]]; // G. C. Greubel, Nov 02 2022
(SageMath) [(2^binomial(n, 2)//factorial(n)) for n in range(1, 30)] # G. C. Greubel, Nov 02 2022
CROSSREFS
Sequence in context: A009345 A084553 A144164 * A119501 A183277 A269006
KEYWORD
nonn,easy
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 04:28 EDT 2024. Contains 371767 sequences. (Running on oeis4.)