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.

A380791 For a positive rational x, let k(x) be the smallest positive integer such that all k >= k(x) have a partition into distinct parts with reciprocal sum equal to x. The n-th term in this sequence is equal to the number of x with k(x) equal to n.

Table of values

n a(n)
66 2
67 2
68 2
69 1
70 2
71 4
72 5
73 5
74 7
75 7
76 5
77 12
78 18
79 22
80 32
81 38
82 41
83 48
84 57
85 76
86 82
87 74
88 97
89 117
90 155
91 170
92 194
93 228
94 277
95 306
96 332
97 430
98 473
99 483
100 510

List of values

[2, 2, 2, 1, 2, 4, 5, 5, 7, 7, 5, 12, 18, 22, 32, 38, 41, 48, 57, 76, 82, 74, 97, 117, 155, 170, 194, 228, 277, 306, 332, 430, 473, 483, 510]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.