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.

A118771 Let a "sum" be a set {x,y,z} of distinct natural numbers such that x+y=z and let N_m={1,2,...m}. a(n) is the smallest s such that there is no partition of N_s into n sum-free parts.

Table of values

n a(n)
1 3
2 9
3 24
4 67

List of values

[3, 9, 24, 67]

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

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