|
Search: id:A141019
|
|
|
| A141019 |
|
a(n) is the largest number in the n-th row of triangle A140996. |
|
+0
1
|
|
| 1, 1, 2, 4, 8, 16, 31, 60, 116, 224, 432, 833, 1606, 3096, 5968, 11504, 22175, 42744, 84752, 169880, 340013, 679604, 1356641, 2704954, 5387340, 10718620, 21304973, 42308331, 83945336, 166423276, 329683867, 652627294, 1291020297, 2552209710, 5042305104
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
Also the largest number in the n-th row of A140995.
|
|
FORMULA
|
a(n) = max( A140996(n,k),k=0..n) .
|
|
EXAMPLE
|
The largest number of 1, is a(0)=1
The largest number of 1 1 is a(1)=1
The largest number of 1 2 1 is a(2)=2
The largest number of 1 4 2 1 is a(3)=4
The largest number of 1 8 4 2 1 is a(4)=8
The largest number of 1 16 8 4 2 1 is a(5)=16
The largest number of 1 31 17 8 4 2 1 is a(6)=31
|
|
MAPLE
|
A140996 := proc(n, k) option remember ; if k<0 or k>n then 0 ; elif k=0 or k=n then 1 ; elif k=n-1 then 2 ; elif k=n-2 then 4 ; elif k=n-3 then 8 ; else procname(n-1, k)+procname(n-2, k) +procname(n-3, k)+procname(n-4, k)+procname(n-4, k-1) ; fi; end:
A141019 := proc(n) max(seq(A140996(n, k), k=0..n)) ; end: for n from 0 to 50 do printf("%d, ", A141019(n)) ; od: # R. J. Mathar, Sep 19 2008
|
|
CROSSREFS
|
Cf. A007318, A140996.
Sequence in context: A102726 A118891 A107066 this_sequence A152718 A006775 A104993
Adjacent sequences: A141016 A141017 A141018 this_sequence A141020 A141021 A141022
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Juri-Stepan Gerasimov (2stepan(AT)rambler.ru), Jul 11 2008
|
|
EXTENSIONS
|
Partially edited by N. J. A. Sloane (njas(AT)research.att.com), Jul 18 2008
Simplified definition and extended by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Sep 19 2008
|
|
|
Search completed in 0.002 seconds
|
