|
Search: id:A115866
|
|
|
| A115866 |
|
a(n) = g(n,n,n) where g(a, b, c) is defined as follows: if a = 0 or b = 0 or c = 0 then return 1 otherwise return g(a, b, c-1) + g(a, b-1, c) + g(a-1, b, c) + g(a, b-1, c-1) + g(a-1, b, c-1) + g(a-1, b-1, c) + g(a-1, b-1, c-1). |
|
+0
2
|
|
| 1, 7, 157, 5419, 220561, 9763807, 454635973, 21894817147, 1080094827649, 54250971690007, 2763339510402637, 142338478909290187, 7399210542653679985
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
A generalization of the recurrence in A001850. The original description of this sequence was the same as that of A126086. The correct explanation for these terms was provided by Nick Hobson (nickh(AT)qbyte.org), Mar 03 2007.
|
|
CROSSREFS
|
Cf. A001850, A126086.
Sequence in context: A111831 A139226 A073605 this_sequence A009703 A014385 A114485
Adjacent sequences: A115863 A115864 A115865 this_sequence A115867 A115868 A115869
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Al Zimmermann (alzimmerma(AT)aol.com), Apr 02 2006
|
|
EXTENSIONS
|
Edited by njas following email from Nick Hobson (nickh(AT)qbyte.org), Mar 03 2007
|
|
|
Search completed in 0.002 seconds
|
