|
Search: id:A091820
|
|
|
| A091820 |
|
Number of partitions of n where each partition is created by a down-only cascade through Pascal's Triangle, starting at C(0,0)=1 at the apex and shifting left or right by exactly one position at each step. |
|
+0
1
|
|
| 1, 2, 2, 4, 2, 4, 6, 4, 2, 6, 6, 6, 8, 4, 4, 10, 2, 6, 6, 6, 8, 14, 12, 4, 6, 6
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
Pascal's triangle:
......1
....1..1
...1..2..1
..1..3.3..1
.1.4..6..4.1
1.5.10.10.5.1
Then we can create 7 by 1+1+1+1+1+1+1 on the left and right, and 1+1+2+3 gives 4 more possibilities, giving a(7)=6. Similarly, 10=10*1 (left & right) =5*1+5 (left & right)=3*1+4+3 (left & right), giving a(10)=6.
|
|
CROSSREFS
|
Sequence in context: A060609 A109526 A059214 this_sequence A063789 A106264 A035096
Adjacent sequences: A091817 A091818 A091819 this_sequence A091821 A091822 A091823
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Jon Perry (perry(AT)globalnet.co.uk), Mar 08 2004
|
|
EXTENSIONS
|
Extended and edited by John W. Layman (layman(AT)math.vt.edu), Mar 10 2004
|
|
|
Search completed in 0.002 seconds
|
