Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A004734
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A004734 Numerator of average distance traveled by n-dimensional fly. +0
2
1, 8, 3, 32, 5, 64, 35, 512, 63, 1024, 231, 4096, 429, 8192, 6435, 131072, 12155, 262144, 46189, 1048576, 88179, 2097152, 676039, 16777216, 1300075, 33554432, 5014575, 134217728, 9694845, 268435456, 300540195 (list; graph; listen)
OFFSET

1,2

REFERENCES

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

CROSSREFS

Cf. A004735.

Sequence in context: A037206 A065530 A137481 this_sequence A049074 A038281 A131502

Adjacent sequences: A004731 A004732 A004733 this_sequence A004735 A004736 A004737

KEYWORD

nonn,frac

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research