Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A065071
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A065071 Minimum number of identical bricks of length 1 which, when stacked without mortar in the naive way, form a stack of length >=n. +0
1
1, 5, 32, 228, 1675, 12368, 91381, 675215, 4989192, 36865413, 272400601, 2012783316, 14872568832, 109894245430, 812014744423, 6000022499694, 44334502845081, 327590128640501, 2420581837980562, 17885814992891027 (list; graph; listen)
OFFSET

1,2

COMMENT

The ratios a(n+1)/a(n) seem to approach e^2=7.389056..., with 7-place agreement for n=11.

Comment from Douglas Rogers, Aug 31, 2005: Note that one can do ''better'' in terms of projections if you group the bricks asymmetrically into lozenges with holes in them. See the Ainsley and Drummond references. Ainsley considers only the case of four bricks, but achieves an overhang of (15-4sqrt2)/8, compared with 25/24 for the harmonic pile.

REFERENCES

S. Ainley, Letter, Math. Gaz., 63 (1979), 272.

J. E. Drummond, On stacking bricks to achieve a large overhang, Math. Gaz., 65 (1981), 40-42.

N. J. A. Sloane, Illustration for sequence M4299 (=A007340) in The Encyclopedia of Integer Sequences (with S. Plouffe), Academic Press, 1995.

LINKS

R. Dickau, Harmonic numbers and the book-stacking problem

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics

FORMULA

Equals A002387(2n) + 1.

EXAMPLE

Obviously a(1)=1. If the center of gravity of one brick is placed at the end of a second brick, the length of the stack of 2 bricks is 1.5. If the c.g. of that stack is placed at the end of a third brick, the length of the stack is 1.75. Continuing, we get a stack of length 1.916666... for 4 bricks and a stack of length 2.0416666... for 5 bricks. Thus a(2)=5.

CROSSREFS

Cf. harmonic numbers H(n) = A001008/A002805, A002387, A004080.

Sequence in context: A006214 A015541 A024064 this_sequence A146965 A053157 A102231

Adjacent sequences: A065068 A065069 A065070 this_sequence A065072 A065073 A065074

KEYWORD

nonn,easy

AUTHOR

John W. Layman (layman(AT)math.vt.edu), Nov 08 2001

EXTENSIONS

More terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), Nov 14 2001

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 December 3 16:57 EST 2008. Contains 151279 sequences.


AT&T Labs Research