login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A102055 Column 1 of A102054, the matrix inverse of A060083 (Euler polynomials). 4
1, 2, 1, 4, -13, 142, -1931, 36296, -893273, 27927346, -1081725559, 50861556172, -2854289486309, 188475382997654, -14467150771771043, 1277417937676246672, -128570745743431055281, 14632875988040732946106, -1869882665740777942166543, 266593648798424693540514836 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

1-a(n+1) equals the n-th partial sum of the Genocchi numbers (A001469).

LINKS

Table of n, a(n) for n=0..19.

FORMULA

a(n) = 1 - Sum_{k=1, n} A001469(k) for n>0, with a(0)=1.

This sequence's twin numbers are given in A133135. - Paul Curtz, Aug 07 2008

PROG

(PARI) {a(n)=local(M=matrix(n+2, n+2)); M[1, 1]=1; if(n>0, M[2, 1]=1; M[2, 2]=1); for(r=3, n+2, for(c=1, r, M[r, c]=if(c==1, M[r-1, 1], if(c==r, 1, M[r, c]=M[r-1, c]-((matrix(r-1, r-1, i, j, M[i, j]))^-1)[r-1, c-1])))); return(if(n==0, 1, M[n+2, 2]))}

CROSSREFS

Cf. A001469, A060083, A102054, A102056.

Sequence in context: A088624 A066409 A006173 * A232376 A162977 A032174

Adjacent sequences:  A102052 A102053 A102054 * A102056 A102057 A102058

KEYWORD

sign

AUTHOR

Paul D. Hanna, Dec 28 2004

STATUS

approved

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

Content is available under The OEIS End-User License Agreement .

Last modified November 23 07:56 EST 2014. Contains 249839 sequences.