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.

Showing 1-1 of 1 results.

A117549 Values of n for which there exist d(1),...,d(n), each in {0,1,...,4} and an r in {1,...,4} such that Sum[d(i)d(i+k),i=1,n-k]=r (mod 5) for all k=0,...,n-1. (Such a sequence is called a very(5,r) sequence. See the link.).

Original entry on oeis.org

1, 3, 6, 10, 13, 16
Offset: 1

Views

Author

John W. Layman, Apr 21 2006

Keywords

Comments

Conjecture. Let A be a very(5,1) (respectively very(5,4)) sequence of length n and let Z be a sequence of n-1 0's.. Then AZ(3A)ZA is a very(5,1) (respectively very(5,4)) sequence of length 5n-2. (Here 3A denotes the result of multiplying each term of A by 3, then reducing modulo 5; and juxtaposition of symbols denotes concatenation of sequences.)

Crossrefs

Showing 1-1 of 1 results.