login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A357042 The sum of the numbers of the central diamond of the multiplication table [1..k] X [1..k] for k=2*n-1. 1
1, 20, 117, 400, 1025, 2196, 4165, 7232, 11745, 18100, 26741, 38160, 52897, 71540, 94725, 123136, 157505, 198612, 247285, 304400, 370881, 447700, 535877, 636480, 750625, 879476, 1024245, 1186192, 1366625, 1566900, 1788421, 2032640, 2301057, 2595220, 2916725, 3267216, 3648385 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
a(n) is the sum of the elements of the multiplication table, forming the maximum diamond in its center.
LINKS
Nicolay Avilov, Drawing for a(1)-a(5)
FORMULA
a(n) = n^2*(2*n^2 - 2*n + 1).
а(n) = 2*A000583(n) - A015237(n).
From Stefano Spezia, Sep 19 2022: (Start)
G.f.: x*(1 + 15*x + 27*x^2 + 5*x^3)/(1 - x)^5.
a(n) = A000290(n)*A001844(n-1). (End)
EXAMPLE
In the multiplication table [1..3] X [1..3]: a(2) = 2+2+4+6+6 = 20;
In the multiplication table [1..5] X [1..5]: a(3) = 3+4+3+6+6+8+9+8+12+12+15+16+15 = 117.
For n=3, the multiplication table [1..5] X [1..5] and the terms summed are
* 1 2 3 4 5
-----------------
1| 3
2| 4 6 8
3| 3 6 9 12 15
4| 8 12 16
5| 15
CROSSREFS
Sequence in context: A220928 A206368 A258667 * A299965 A244289 A293880
KEYWORD
nonn,easy
AUTHOR
Nicolay Avilov, Sep 18 2022
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 11:46 EDT 2024. Contains 371241 sequences. (Running on oeis4.)