cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A113749 Consider the generalized Mancala solitaire (A002491); to get n-th term, start with n and successively round up to next k multiples of n-1, n-2, ..., 1, for n>=1. Now construct the array, t, such that t(n,k) is the n-th and successively rounding up to the next k multiples. This sequence is the presentation of that array by reading the antidiagonals.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 2
6 1
7 1
8 3
9 4
10 1
11 1
12 4
13 7
14 6
15 1
16 1
17 5
18 10
19 13
20 10
21 1
22 1
23 6
24 13
25 18
26 19
27 12
28 1
29 1
30 7
31 16
32 25
33 30
34 27
35 18
36 1
37 1
38 8
39 19
40 30
41 39
42 42
43 39
44 22
45 1
46 1
47 9
48 22
49 37
50 48
51 61
52 58
53 49
54 30
55 1
56 1
57 10
58 25
59 42
60 61
61 72
62 79
63 78
64 63
65 34
66 1
67 1
68 11
69 28
70 49
71 70
72 87
73 102
74 103
75 102
76 79
77 42
78 1
79 1
80 12
81 31

List of values

[1, 1, 1, 1, 2, 1, 1, 3, 4, 1, 1, 4, 7, 6, 1, 1, 5, 10, 13, 10, 1, 1, 6, 13, 18, 19, 12, 1, 1, 7, 16, 25, 30, 27, 18, 1, 1, 8, 19, 30, 39, 42, 39, 22, 1, 1, 9, 22, 37, 48, 61, 58, 49, 30, 1, 1, 10, 25, 42, 61, 72, 79, 78, 63, 34, 1, 1, 11, 28, 49, 70, 87, 102, 103, 102, 79, 42, 1, 1, 12, 31]