Let G denote the 9-node, 16-edge graph formed from an octagon with main diagonals drawn and a node at the center; a(n) = number of magic labelings of G with magic sum 2n.
A244867
Let G denote the 9-node, 16-edge graph formed from an octagon with main diagonals drawn and a node at the center; a(n) = number of magic labelings of G with magic sum 2n.
Terms
- a(0) =1a(1) =32a(2) =320a(3) =1784a(4) =7040a(5) =22104a(6) =58980a(7) =139320a(8) =299343a(9) =596200a(10) =1115972a(11) =1983488a(12) =3374150a(13) =5527952a(14) =8765880a(15) =13508880a(16) =20299581a(17) =29826960a(18) =42954136a(19) =60749480a(20) =84521228a(21) =115855784a(22) =156659900a(23) =209206920a(24) =276187275a(25) =360763416a(26) =466629372a(27) =598075120a(28) =760055954a(29) =958267040
External references
- oeis: A244867