A262553 Square array read by antidiagonals: number of ways of making change when coins have values 1,2,4,8,16,...
1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 2, 1, 0, 1, 1, 2, 3, 1, 0, 1, 1, 2, 4, 4, 1, 0, 1, 1, 2, 4, 6, 5, 1, 0, 1, 1, 2, 4, 6, 9, 6, 1, 0, 1, 1, 2, 4, 6, 10, 12, 7, 1, 0, 1, 1, 2, 4, 6, 10, 14, 16, 8, 1, 0, 1, 1, 2, 4, 6, 10, 14, 20, 20, 9, 1, 0, 1, 1, 2, 4, 6, 10, 14, 20, 26, 25, 10, 1, 0
Offset: 0
Examples
Rows 0,1,2,3,... are: 1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,... 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,... 1,1,2,3,4,5,6,7,8,9,10,11,12,13,... 1,1,2,4,6,9,12,16,20,25,30,36,... 1,1,2,4,6,10,14,20,26,35,44,56,... 1,1,2,4,6,10,14,20,26,36,46,60,... ...
Links
- Alois P. Heinz, Antidiagonals n = 0..140, flattened
- G. Blom and C.-E. Froeberg, Om myntvaexling (On money-changing) [Swedish], Nordisk Matematisk Tidskrift, 10 (1962), 55-69, 103. [Annotated scanned copy]