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!)
A219070 a(n) = (46*n^5 + 30*n^4 + 15*n^3 - n) / 30. 2

%I #19 Jan 26 2022 12:38:45

%S 0,3,69,467,1858,5479,13327,28343,54596,97467,163833,262251,403142,

%T 598975,864451,1216687,1675400,2263091,3005229,3930435,5070666,

%U 6461399,8141815,10154983,12548044,15372395,18683873,22542939,27014862,32169903,38083499,44836447

%N a(n) = (46*n^5 + 30*n^4 + 15*n^3 - n) / 30.

%C For n > 0: row sums of the triangle A219069.

%H Reinhard Zumkeller, <a href="/A219070/b219070.txt">Table of n, a(n) for n = 0..1000</a>

%F a(n) = A000584(n) + A000290(n)*A000330(n) + A000538(n).

%t Table[(46n^5 + 30n^4 + 15n^3 - n)/30, {n, 0, 39}] (* _Alonso del Arte_, Nov 12 2012 *)

%o (Haskell)

%o a219070 n = n * (n * (n * (n * (46 * n + 30) + 15)) - 1) `div` 30 -- _Reinhard Zumkeller_

%o (Maxima) A219070(n):=(46*n^5 + 30*n^4 + 15*n^3-n)/30$

%o makelist(A219070(n),n,0,30); /* _Martin Ettl_, Nov 12 2012 */

%Y Cf. A000290, A000330, A000538, A000584, A219069.

%K nonn,easy

%O 0,2

%A _Reinhard Zumkeller_, Nov 11 2012

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 August 19 15:59 EDT 2024. Contains 375310 sequences. (Running on oeis4.)