login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A226220 Maximum number of entries of the multiplication table mod p realizable additively, where p is the n-th prime. 0
3, 6, 12, 19, 37, 47 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
The maximum number of pairs i,j such that ij=f(i)+g(j) mod p, maximized over all functions f, g (mod p), for p=2,3,5,7,11... Lower bounds are known for the next five terms (starting with p=19): 66, 79, 99, 135, 148
LINKS
Y.-C. Liang, C.-W. Lim and D.-L. Deng, Reexamination of a multisetting Bell inequality for qudits, Phys. Rev. A, 80 (2009), 052116.
EXAMPLE
For the second term a(2)=6, p=3, and one can take f(0)=g(0)=f(1)=g(1)=0, f(2)=g(2)=2.
CROSSREFS
Sequence in context: A351621 A209489 A181962 * A218076 A308722 A320192
KEYWORD
nonn,hard
AUTHOR
Peter Shor, May 31 2013
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 08:12 EDT 2024. Contains 371236 sequences. (Running on oeis4.)