A338012 a(1)=0; thereafter, a(n) is the smallest number such that the addition and multiplication tables for (a(1),...,a(n)) together contain n^2 different entries (the maximum possible).
0, 3, 4, 10, 18, 23, 34, 55, 67, 93, 95, 120, 149, 166, 228, 271, 351, 398, 439, 505, 563, 611, 732, 771, 806, 924, 1052, 1121, 1278, 1412, 1586, 1654, 1875, 2012, 2245, 2341, 2445, 2616, 2819, 2920, 3034, 3322, 3518, 3754, 3918, 4016, 4311, 4649, 4848, 5321
Offset: 1
Keywords
Examples
Addition table begins: + | 0 3 4 10 18 23 34 55 67 -----+------------------------------- 0 | 0 3 | 3 6 4 | 4 7 8 10 | 10 13 14 20 18 | 18 21 22 28 36 23 | 23 26 27 33 41 46 34 | 34 37 38 44 52 57 68 55 | 55 58 59 65 73 78 89 110 67 | 67 70 71 77 85 90 101 122 134 Multiplication table begins: * | 0 3 4 10 18 23 34 55 67 -----+--------------------------------------- 0 | 0 3 | 0 9 4 | 0 12 16 10 | 0 30 40 100 18 | 0 54 72 180 324 23 | 0 69 92 230 414 529 34 | 0 102 136 340 612 782 1156 55 | 0 165 220 550 990 1265 1870 3025 67 | 0 201 268 670 1206 1541 2278 3685 4489
Links
- Peter Kagey, Table of n, a(n) for n = 1..1000