login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A317244 For n>=3, smallest prime number N such that for every prime p>=N, every element in Z_p can be expressed as a sum of two n-gonal numbers mod p, without allowing zero as a summand. 0
11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 13, 11, 11, 11, 11, 11, 11, 11, 23, 11, 11, 13, 29, 11, 11, 11, 11, 11, 11, 11, 37, 11, 13, 11, 11, 11, 11, 23, 11, 11, 11, 11, 47, 13, 11, 29, 53, 11, 11, 11, 11, 11, 11, 11, 13, 11, 23, 11, 61, 11, 11, 37, 11, 11, 11, 13, 71, 11, 29, 11, 73, 11, 11, 11, 11, 23, 13, 11, 83, 11, 11, 11, 89, 11, 11, 47, 11, 13, 11, 11, 11, 29, 37, 53, 23, 11 (list; graph; refs; listen; history; text; internal format)
OFFSET

3,1

REFERENCES

J. Harrington, L. Jones, and A. Lamarche, Representing integers as the sum of two squares in the ring $\mathbb{Z}_n$, \emph{J. Integer Seq.} 17 (2014), no. 7, article 14.7.4, 10 pp.

B. M. Moore and J. H. Straight, Pythagorean triples in multiplicative groups of prime power order (details needed).

LINKS

Table of n, a(n) for n=3..99.

CROSSREFS

Sequence in context: A112122 A290856 A010850 * A113587 A083971 A240453

Adjacent sequences:  A317241 A317242 A317243 * A317245 A317246 A317247

KEYWORD

nonn

AUTHOR

Theresa Baren, James Hammer, Joshua Harrington, Ziyu Liu, Sean E. Rainville, Melea Roman, Hongkwon V. Yi, Jul 24 2018

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 16 02:14 EDT 2021. Contains 345055 sequences. (Running on oeis4.)