[go: up one dir, main page]

login
Revision History for A024000 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
a(n) = 1 - n.
(history; published version)
#33 by Charles R Greathouse IV at Thu Sep 08 08:44:48 EDT 2022
PROG

(MAGMAMagma) [1-n: n in [0..50]]; // Vincenzo Librandi, Apr 29 2011

Discussion
Thu Sep 08
08:44
OEIS Server: https://oeis.org/edit/global/2944
#32 by N. J. A. Sloane at Sat Mar 12 22:34:17 EST 2016
STATUS

proposed

approved

#31 by Wesley Ivan Hurt at Wed Mar 02 22:18:21 EST 2016
STATUS

editing

proposed

#30 by Wesley Ivan Hurt at Wed Mar 02 22:15:30 EST 2016
LINKS

<a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).

FORMULA

a(n) = Sum_{k=0..n} A094816(n,k)*(-1)^k (alternating row sums of Poisson-Charlier coefficient matrix).

O.g.f.: (1-2x2*x)/(1-x)^2. a(n+1) = A001489(n). -_ _R. J. Mathar_, May 28 2008

a(n) = 2*a(n-1)-a(n-2) for n>1. - Wesley Ivan Hurt, Mar 02 2016

MAPLE

A024000:=n->1-n: seq(A024000(n), n=0..100); # Wesley Ivan Hurt, Mar 02 2016

CROSSREFS

a(n)=sum(A094816(n, k)*(-1)^k, k=0..n), n>=0 (alternating row sums of Poisson-Charlier coefficient matrix).

Cf. A001489, A094816.

AUTHOR
STATUS

proposed

editing

#29 by Robert G. Wilson v at Wed Mar 02 21:30:12 EST 2016
STATUS

editing

proposed

#28 by Robert G. Wilson v at Wed Mar 02 21:30:01 EST 2016
MATHEMATICA

Flatten[NestList[(#/.x_/; x>1->Sequence[x, 2x])-1&, {1}, 60]]

(* Robert G. Wilson v, Mar 02 2016 *)

STATUS

approved

editing

#27 by Bruno Berselli at Fri Jun 12 09:18:18 EDT 2015
STATUS

editing

approved

#26 by Bruno Berselli at Fri Jun 12 09:18:15 EDT 2015
COMMENTS

a(n) is the weighted sum over all derangements (permutations with no fixed points) of n elements where each permutation with an odd number of cycles has weight +1 and each with an even number of cycles has weight -1. [Michael Somos, Jan 19 2011]

FORMULA

a(n) is the weighted sum over all derangements (permutations with no fixed points) of n elements where each permutation with an odd number of cycles has weight +1 and each with an even number of cycles has weight -1. [From Michael Somos, Jan 19 2011]

STATUS

approved

editing

#25 by Bruno Berselli at Fri Jun 12 09:17:26 EDT 2015
STATUS

editing

approved

#24 by Bruno Berselli at Fri Jun 12 09:17:19 EDT 2015
NAME

a(n) = 1 - n.

PROG

(MAGMA) [1-n: n in [0..50]]; // _Vincenzo Librandi, _, Apr 29 2011

KEYWORD

sign,easy

STATUS

approved

editing