|
Search: id:A109363
|
|
|
| A109363 |
|
a(n) = 4*2^n - 3*n - 5. |
|
+0
1
|
|
| -1, 0, 5, 18, 47, 108, 233, 486, 995, 2016, 4061, 8154, 16343, 32724, 65489, 131022, 262091, 524232, 1048517, 2097090, 4194239, 8388540, 16777145, 33554358, 67108787, 134217648, 268435373, 536870826, 1073741735, 2147483556, 4294967201, 8589934494, 17179869083, 34359738264
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
This sequence appears alongside the Eulerian numbers A000295 in the batch of sequences generated by the floretion given in the program code.
|
|
FORMULA
|
G.f. (1-4*x)/((2*x-1)*(x-1)^2)
|
|
MAPLE
|
a:=n->sum (2^j-3, j=3..n): seq(a(n), n=1..34); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 27 2007
|
|
PROGRAM
|
Floretion Algebra Multiplication Program, FAMP Code: 4ibaseisumseq[ - .5'i - .75'j - .5i' - .75j' + .25'ii' + .25'jj' - 1.25'kk' - .25'ik' + .5'jk' - .25'ki' + .5'kj' + .75e]; sumtype: Y[8] = (int)Y[6] - (int)Y[7] + Y[8] + sum (internal program code)
|
|
CROSSREFS
|
Cf. A000295.
Sequence in context: A007237 A000339 A081435 this_sequence A146213 A036893 A125641
Adjacent sequences: A109360 A109361 A109362 this_sequence A109364 A109365 A109366
|
|
KEYWORD
|
easy,sign
|
|
AUTHOR
|
Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), Aug 22 2005
|
|
|
Search completed in 0.002 seconds
|
