|
| |
|
|
A070234
|
|
Let u(k) v(k) w(k) be the recursions u(1)=v(1)=w(1)=1 u(k+1)=u(k)+v(k)+w(k) v(k+1)=u(k)v(k)+v(k)w(k)+w(k)u(k) w(k+1)=u(k)v(k)w(k); then a(n)=v(n).
|
|
0
| |
|
|
1, 3, 15, 303, 325023, 2896797882687, 10689080432835089614170716799, 1051462916692114532403603811392745230616355871287492722818364671, 4082719105466537261158902273424141350756102191374943243599962042648477047915967800878229988886787905692389015371739271187273873490265611528703
(list; graph; refs; listen; history; internal format)
|
| |
| |
|
|
