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!)
A074052 The lowest order term in an expansion of sum_{i=1..m}*i^n*(i+1)! in a special factorial basis. 2

%I #11 Oct 29 2023 17:28:25

%S 0,-2,2,2,-14,26,34,-398,1210,450,-23406,118634,-166286,-1983342,

%T 18159658,-68002894,-112926670,3497644570,-24969255550,64943618962,

%U 607880756218,-9318511004702,60525142971954,-80108659182870,-3000122066181358

%N The lowest order term in an expansion of sum_{i=1..m}*i^n*(i+1)! in a special factorial basis.

%C For each n there unique numbers a(n) and b(n) and a polynomial p_n such that for all integers m: Sum_{i=1..m} i^n *(i+1)! = a(n) + b(n)*sum_{i=1..m}(i+1)! + p_n(m)*(m+2)! The sequence b(n) is A074051(n), and this sequence here are the a(n).

%e a(0) = 0 because sum_{i=1..m} (i+1)! = 0 + 1*Sum_{i=1..m} (i+1)! + 0*(m+2)!.

%e a(1) = -2 because sum_{i=1..m} i*(i+1)! = -2 -1*sum_{i=1..m} (i+1)! +1*(m+2)!.

%e a(2) = 2 because sum_{i=1..m} i^2*(i+1)! = 2 +0*sum_{i=1..m} (i+1)!+ (m-1)*(m+2)!.

%e a(3) = 2 because Sum_{i=1..n} i^3*(i+1)! = 2 +3*sum_{i=1..m} (i+1)!+(m^2-m-1)*(m+2)!.

%e a(4)=-14 because sum_{i=1..n}i^4*(i+1)! = -14 -7*Sum_{i=1..n} (i+1)! +(m^3-m^2-2*m+7)* (m+2)!.

%t A[a_] := Module[{p, k}, p[n_] = 0; For[k = a - 1, k >= 0, k--, p[n_] = Expand[p[n] + n^k Coefficient[n^a - (n + 2)p[n] + p[n - 1], n^(k + 1)]] ]; -2 p[0] ]

%Y Cf. A074051, A197184.

%K easy,sign

%O 0,2

%A _Jan Fricke_, Aug 14 2002

%E More terms from R. J. Mathar, Oct 11 2011

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 April 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)