|
Search: id:A108765
|
|
|
| A108765 |
|
G.f. (1-x+x^2)/((1-3*x)*(x-1)^2). |
|
+0
1
|
|
| 1, 4, 14, 45, 139, 422, 1272, 3823, 11477, 34440, 103330, 310001, 930015, 2790058, 8370188, 25110579, 75331753, 225995276, 677985846, 2033957557, 6101872691, 18305618094, 54916854304, 164750562935, 494251688829, 1482755066512
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Superseeker suggests a(n+2)-2*a(n+1)+a(n) = 7*3^n = A005032(n); inverse binomial transform gives match with first differences of A026622.
|
|
FORMULA
|
a(0) = 1; a(n) = 3*a(n-1)+n. a(n) = (7*3^n - 2*n - 3)/4. - Rolf Pleisch (r_pleisch(AT)gmx.ch), Feb 10 2008
|
|
PROGRAM
|
Floretion Algebra Multiplication Program, FAMP Code: kbasefor[(- 'j + 'k - 'ii' - 'ij' - 'ik')], vesfor = A000004, Fortype: 1A, Roktype (leftfactor) is set to:Y[sqa.Findk()] = Y[sqa.Findk()] + Math.signum(Y[sqa.Findk()])*p (internal program code)
|
|
CROSSREFS
|
Cf. A005032, A026622.
Sequence in context: A083377 A047115 A125068 this_sequence A005775 A094688 A068092
Adjacent sequences: A108762 A108763 A108764 this_sequence A108766 A108767 A108768
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), Jun 24 2005
|
|
|
Search completed in 0.002 seconds
|
