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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A155587 Expansion of (1+x*c(x))/(1-x), c(x) the g.f. of A000108. 4
1, 2, 3, 5, 10, 24, 66, 198, 627, 2057, 6919, 23715, 82501, 290513, 1033413, 3707853, 13402698, 48760368, 178405158, 656043858, 2423307048, 8987427468, 33453694488, 124936258128, 467995871778, 1757900019102, 6619846420554 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

Row sums of A155586. Hankel transform is A057079(n+2).

a(n) = A014138(n-1) + 1 for n > 0. - Reinhard Zumkeller, Mar 01 2013

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 0..1000

Gerard Cohen and Jean-Pierre Flori, On a generalized combinatorial conjecture involving addition mod 2^k - 1, IACR, Report 2011/400.

Jean-Pierre Flori, Fonctions booléennes, courbes algébriques et multiplication complexe, Thesis, ParisTech, Feb 03 2012.

Guo-Niu Han, Enumeration of Standard Puzzles

Guo-Niu Han, Enumeration of Standard Puzzles [Cached copy]

FORMULA

a(n) = 1 + Sum_{k=0..n-1} A000108(k).

Conjecture: n*a(n) +(6-5*n)*a(n-1) +2*(2*n-3)*a(n-2)=0. - R. J. Mathar, Nov 15 2011

PROG

(Haskell)

a155587 n = a155587_list !! n

a155587_list = scanl (+) 1 a000108_list  -- Reinhard Zumkeller, Mar 01 2013

CROSSREFS

Sequence in context: A099967 A106531 A101163 * A125658 A001200 A050837

Adjacent sequences:  A155584 A155585 A155586 * A155588 A155589 A155590

KEYWORD

easy,nonn,changed

AUTHOR

Paul Barry, Jan 24 2009

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified February 21 19:50 EST 2018. Contains 299423 sequences. (Running on oeis4.)