Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A116666
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A116666 Triangle, row sums = number of edges in n-dimensional hypercubes. +0
3
1, 1, 3, 1, 6, 5, 1, 9, 15, 7, 1, 12, 30, 28, 9, 1, 15, 50, 70, 45, 11, 1, 18, 75, 140, 135, 66, 13, 1, 21, 105, 245, 315, 231, 91, 15 (list; table; graph; listen)
OFFSET

1,3

COMMENT

Terms in the array rows tend to A001787, number of edges in n-dimensional hypercubes: 1, 4, 12, 32, 80, 192, 448... Row sums of the sequence also = A001787.

FORMULA

From an array, rows = binomial transforms of (1,0,0,0...); (1,3,0,0,0...); (1,3,5,0,0,0...); difference rows of the columns become rows of the triangle.

EXAMPLE

First few rows of the array are:

1 1 1 1 1...

1 4 7 10 13...

1 4 12 25 43...

1 4 12 32 71...

1 4 12 32 80...

...

Then take differences of columns which become rows of the triangle:

1;

1, 3;

1, 6, 5;

1, 9, 15, 7;

1, 12, 30, 28, 9;

1, 15, 50, 70, 45, 11;

1, 18, 75, 140, 135, 66, 13;

1, 21, 105, 245, 315, 231, 91, 15;

...

CROSSREFS

Cf. A001787.

Adjacent sequences: A116663 A116664 A116665 this_sequence A116667 A116668 A116669

Sequence in context: A007383 A120394 A016575 this_sequence A061702 A112351 A143858

KEYWORD

nonn,tabl

AUTHOR

Gary W. Adamson (qntmpkt(AT)yahoo.com), Feb 22 2006

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 October 12 15:26 EDT 2008. Contains 144830 sequences.


AT&T Labs Research