|
|
A078684
|
|
a(n) = 3^floor(n^2/4).
|
|
0
|
|
|
1, 1, 3, 9, 81, 729, 19683, 531441, 43046721, 3486784401, 847288609443, 205891132094649, 150094635296999121, 109418989131512359209, 239299329230617529590083, 523347633027360537213511521, 3433683820292512484657849089281, 22528399544939174411840147874772641
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
Number of groves of order n.
|
|
LINKS
|
Gabriel D. Carroll and David Speyer, The cube recurrence, The Electronic Journal of Combinatorics, Volume 11, Issue 1 (2004), R73.
|
|
FORMULA
|
0 = a(n)*a(n+3) - 3*a(n+1)*a(n+2) for all n in Z. - Michael Somos, Jan 25 2014
|
|
MATHEMATICA
|
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|