|
Search: id:A109058
|
|
|
| A109058 |
|
To compute a(n) we first write down 6^n 1's in a row. Each row takes the rightmost 6th part of the previous row, and each element in it equals sum of the elements of the previous row starting with the first of the rightmost 6th part. The single element in the last row is a(n). |
|
+0
6
|
|
| 1, 1, 6, 201, 39656, 46769781, 330736663032, 14031372754200653
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
EXAMPLE
|
For example, for n=3 the array, from 2nd row, follows:
1..2..3.....25..26..27..28..29..30..31..32..33..34..35..36
....................................31..63..96.130.165.201
.......................................................201
Therefore a(3)=201.
|
|
MAPLE
|
proc(n::nonnegint) local f, a; if n=0 or n=1 then return 1; end if; f:=L->[seq(add(L[i], i=5*nops(L)/6+1..j), j=5*nops(L)/6+1..nops(L))]; a:=f([seq(1, j=1..6^n)]); while nops(a)>6 do a:=f(a) end do; a[6]; end proc;
|
|
CROSSREFS
|
Cf. A107354, A109055, A109056, A109057, A109059, A109060, A109061, A109062.
Sequence in context: A012205 A086065 A112845 this_sequence A003743 A115491 A082405
Adjacent sequences: A109055 A109056 A109057 this_sequence A109059 A109060 A109061
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
A. O. Munagi (amunagi(AT)yahoo.com), Jun 17 2005
|
|
|
Search completed in 0.002 seconds
|
