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.
%I A379999 #5 Jan 09 2025 09:08:00
%S A379999 1,2,8,6,38,2,12,8,2
%N A379999 Number of longest sequences over {0,1,...,n-1} containing no two consecutive blocks with the same average.
%C A379999 a(n) is the last element of row n in A379998.
%C A379999 The sequences counted by a(n) have length A379914(n).
%C A379999 a(n) is even for all n >= 2, because each term x in a sequence can be replaced by n-1-x, giving another sequence of maximum length.
%e A379999 For 1 <= n <= 4, the following sequences are counted:
%e A379999 n | longest sequences
%e A379999 --+-----------------------------------------------------
%e A379999 1 | 0
%e A379999 2 | 010, 101
%e A379999 3 | 010, 012, 020, 101, 121, 202, 210, 212
%e A379999 4 | 0203202, 1310131, 1310313, 2023020, 2023202, 3130131
%Y A379999 Cf. A379914, A379998, A380000.
%K A379999 nonn,more
%O A379999 1,2
%A A379999 _Pontus von Brömssen_, Jan 09 2025