Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A004735
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A004735 Denominator of average distance traveled by n-dimensional fly. +0
3
1, 3, 4, 15, 8, 35, 64, 315, 128, 693, 512, 3003, 1024, 6435, 16384, 109395, 32768, 230945, 131072, 969969, 262144, 2028117, 2097152, 16900975, 4194304, 35102025, 16777216, 145422675, 33554432 (list; graph; listen)
OFFSET

1,2

REFERENCES

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

FORMULA

a(2n) = A001803(n) (conjectured). - R. Stephan, Mar 10 2004

CROSSREFS

Cf. A004734.

Sequence in context: A076365 A070971 A130113 this_sequence A066830 A083061 A136641

Adjacent sequences: A004732 A004733 A004734 this_sequence A004736 A004737 A004738

KEYWORD

nonn,frac

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research