login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A195805 T(n,k)=Number of triangular nXnXn 0..k arrays with all rows and diagonals having the same length having the same sum, with corners zero 10

%I

%S 1,1,1,1,1,2,1,1,3,8,1,1,4,27,16,1,1,5,64,105,64,1,1,6,125,496,1695,

%T 1184,1,1,7,216,1759,24928,284427,5300,1,1,8,343,5052,213319,17528896,

%U 11606931,130324,1,1,9,512,12469,1274808

%N T(n,k)=Number of triangular nXnXn 0..k arrays with all rows and diagonals having the same length having the same sum, with corners zero

%C Table starts

%C ....1........1........1......1.......1.....1...1.1.1.1

%C ....1........1........1......1.......1.....1...1.1.1

%C ....2........3........4......5.......6.....7...8.9

%C ....8.......27.......64....125.....216...343.512

%C ...16......105......496...1759....5052.12469

%C ...64.....1695....24928.213319.1274808

%C .1184...284427.17528896

%C .5300.11606931

%e Some solutions for n=4 k=4

%e .....0........0........0........0........0........0........0........0

%e ....3.1......3.4......2.4......0.3......3.2......3.0......1.4......1.2

%e ...1.3.3....4.4.3....4.2.2....3.2.0....2.4.3....0.3.3....4.2.1....2.3.1

%e ..0.3.1.0..0.3.4.0..0.2.4.0..0.0.3.0..0.3.2.0..0.3.0.0..0.1.4.0..0.1.2.0

%K nonn,tabl

%O 1,6

%A _R. H. Hardin_ Sep 23 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 27 23:46 EDT 2021. Contains 348305 sequences. (Running on oeis4.)