login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A109673 Hexagonal pyramid related to Prouhet-Tarry problem. 6
1, 1, 1, 1, 3, 1, 1, 1, 1, 2, 1, 2, 8, 8, 2, 1, 8, 15, 8, 1, 2, 8, 8, 2, 1, 2, 1, 1, 3, 3, 1, 3, 15, 24, 15, 3, 3, 24, 60, 60, 24, 3, 1, 15, 60, 93, 60, 15, 1, 3, 24, 60, 60, 24, 3, 3, 15, 24, 15, 3, 1, 3, 3, 1, 1, 4, 6, 4, 1, 4, 24, 52, 52, 24, 4, 6, 52, 160, 228, 160, 52, 6, 4, 52 (list; graph; refs; listen; history; internal format)
OFFSET

0,5

COMMENTS

Entries of slices [n,n] in A109672, read by rows.

Greatest numbers in each slice (central numbers) form A002893 : 1, 3, 15, 93, 639, ...

FORMULA

Sum of terms in slice [n, n] = 3^(2n); example : 1+2+1+2+8+15+8+1+2+8+8+2+1+2+1 = 3^4 = 81 for the slice [2, 2].

EXAMPLE

Slice [0, 0]:

... 1 ...

Slice [1,1]:

... 1 1 ...

.. 1 3 1 ...

... 1 1 ...

Slice [2,2]:

.... 1 2 1 ...

... 2 8 8 2 ...

.. 1 8 15 8 1 ...

... 2 8 8 2 ...

.... 1 2 1 ....

Slice [3,3]:

...... 1 3 3 1 .....

.... 3 15 24 15 3 ...

... 3 24 60 60 24 3 ...

.. 1 15 60 93 60 15 1 ...

... 3 24 60 60 24 3 ...

.... 3 15 24 15 3 ....

...... 1 3 3 1 ....

CROSSREFS

Sequence in context: A109393 A030348 A143811 * A023591 A165661 A107711

Adjacent sequences:  A109670 A109671 A109672 * A109674 A109675 A109676

KEYWORD

nonn,tabf,easy

AUTHOR

Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Aug 07 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 18 00:14 EST 2012. Contains 206085 sequences.