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.

A188228 Number of nondecreasing arrangements of n numbers in -(n-1)..(n-1) with sum zero and not more than two numbers equal.

This page as a plain text file.
%I A188228 #7 Jul 22 2025 11:03:32
%S A188228 1,2,4,15,58,245,1082,5020,24040,118154,592332,3019280,15604848,
%T A188228 81614541,431227650,2298833499,12350952158,66818754504,363727676848,
%U A188228 1990946917066,10952512200610,60525264890259,335856363303010,1870732844007387
%N A188228 Number of nondecreasing arrangements of n numbers in -(n-1)..(n-1) with sum zero and not more than two numbers equal.
%C A188228 Column 1 of A188236
%H A188228 R. H. Hardin, <a href="/A188228/b188228.txt">Table of n, a(n) for n = 1..31</a>
%e A188228 All solutions for n=4
%e A188228 .-3...-1...-2...-3...-3...-2...-1...-2...-3...-2...-3...-1...-2...-2...-3
%e A188228 .-1...-1....0....0...-2...-2...-1...-2...-3....0....0....0...-1...-1...-1
%e A188228 ..1....0....1....1....2....1....1....2....3....0....0....0....0....1....2
%e A188228 ..3....2....1....2....3....3....1....2....3....2....3....1....3....2....2
%K A188228 nonn
%O A188228 1,2
%A A188228 _R. H. Hardin_ Mar 24 2011

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

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