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.

A379999 Number of longest sequences over {0,1,...,n-1} containing no two consecutive blocks with the same average.

Original entry on oeis.org

1, 2, 8, 6, 38, 2, 12, 8, 2
Offset: 1

Views

Author

Pontus von Brömssen, Jan 09 2025

Keywords

Comments

a(n) is the last element of row n in A379998.
The sequences counted by a(n) have length A379914(n).
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.

Examples

			For 1 <= n <= 4, the following sequences are counted:
  n | longest sequences
  --+-----------------------------------------------------
  1 | 0
  2 | 010, 101
  3 | 010, 012, 020, 101, 121, 202, 210, 212
  4 | 0203202, 1310131, 1310313, 2023020, 2023202, 3130131
		

Crossrefs