Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A111491
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A111491 a(0) = 1; for n>0, a(n) = (2^n-1)*a(n-1)-(-1)^n. +0
2
1, 2, 5, 36, 539, 16710, 1052729, 133696584, 34092628919, 17421333377610, 17822024045295029, 36481683220718924364, 149392492788843995270579, 1223673908433421165261312590, 20047449641864738950476084161969, 656894782414981901190249849735238224 (list; graph; listen)
OFFSET

0,2

REFERENCES

W. T. Trotter, Combinatorics and Partially Ordered Sets, Johns Hopkins, 1992; see p. 195.

MAPLE

s:=proc(n) option remember; if n=0 then 1 else (2^n-1)*s(n-1)-(-1)^n; fi; end;

CROSSREFS

Cf. A111968.

Sequence in context: A059586 A086832 A147964 this_sequence A086218 A138658 A067464

Adjacent sequences: A111488 A111489 A111490 this_sequence A111492 A111493 A111494

KEYWORD

nonn,new

AUTHOR

njas, Nov 28 2005, typo corrected Nov 21 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 30 22:12 EST 2008. Contains 150989 sequences.


AT&T Labs Research