Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A004732
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A004732 Numerator of n!!/(n+3)!!. +0
2
1, 1, 2, 1, 8, 5, 16, 7, 128, 21, 256, 33, 1024, 429, 2048, 715, 32768, 2431, 65536, 4199, 262144, 29393, 524288, 52003, 4194304, 185725, 8388608, 334305, 33554432, 9694845, 67108864, 17678835, 2147483648 (list; graph; listen)
OFFSET

0,3

REFERENCES

S. Janson, On the traveling fly problem, Graph Theory Notes of New York, Vol. XXXI, 17, 1996.

CROSSREFS

Cf. A004733.

Sequence in context: A089460 A135520 A136230 this_sequence A011244 A008517 A114193

Adjacent sequences: A004729 A004730 A004731 this_sequence A004733 A004734 A004735

KEYWORD

nonn

AUTHOR

njas

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research