VOOZH about

URL: https://oeis.org/history?seq=A211596

⇱ The On-Line Encyclopedia of Integer Sequences (OEIS)

login

Showing all changes.
Number of -2..2 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^(t+u+v)) having two, four, six, seven or eight distinct values for every i,j,k<=n.
#8 by Sean A. Irvine at Fri Oct 03 16:16:20 EDT 2025
STATUS
#7 by Sean A. Irvine at Fri Oct 03 16:16:18 EDT 2025
AUTHOR
STATUS
#6 by Sean A. Irvine at Tue Jul 22 22:47:33 EDT 2025
STATUS
#5 by Sean A. Irvine at Tue Jul 22 22:47:31 EDT 2025
NAME
STATUS
#4 by R. H. Hardin at Mon Apr 16 07:08:04 EDT 2012
STATUS
#3 by R. H. Hardin at Mon Apr 16 07:08:00 EDT 2012
LINKS
#2 by R. H. Hardin at Mon Apr 16 07:07:40 EDT 2012
NAME
DATA
OFFSET
FORMULA
EXAMPLE
KEYWORD
AUTHOR
STATUS
#1 by R. H. Hardin at Mon Apr 16 06:36:28 EDT 2012
NAME
KEYWORD
STATUS