|
| |
|
|
A006236
|
|
n^n-2 (n+2)^n-1.
(Formerly M3698)
|
|
0
| |
|
|
1, 4, 75, 3456, 300125, 42467328, 8931928887, 2621440000000, 1025271882697689, 515978035200000000, 325063112540091870659, 250738401558910243700736
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
REFERENCES
| G. Kreweras, Complexite et circuits Euleriens dans la sommes tensorielles de graphes, J. Combin. Theory, B 24 (1978), 202-212.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
|
CROSSREFS
| Sequence in context: A006412 A206456 A137220 * A120248 A191505 A100323
Adjacent sequences: A006233 A006234 A006235 * A006237 A006238 A006239
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
