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!)
A262436 Number of ways to represent 2n - 1 as p^2 + q^2 + r with p, q, and r prime, and p >= q. 1
0, 0, 0, 0, 0, 1, 1, 2, 0, 1, 2, 1, 2, 1, 1, 3, 0, 1, 3, 2, 2, 0, 2, 2, 2, 2, 2, 4, 2, 1, 4, 3, 3, 2, 3, 3, 1, 3, 4, 4, 5, 0, 2, 5, 2, 4, 3, 2, 4, 1, 4, 3, 5, 2, 3, 5, 1, 4, 6, 2, 5, 2, 2, 4, 3, 3, 3, 5, 3, 3, 5, 2, 4, 6, 3, 3, 4, 2, 6, 6, 3, 3, 5, 3, 3, 6, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,8

COMMENTS

k is in A212292 if and only if a((k+1)/2) = 0.

LINKS

Peter Kagey, Table of n, a(n) for n = 1..10000

FORMULA

a(16) = 3 because there are three different ways to represent 16 * 2 - 1 = 31 in the form p^2 + q^2 + r with p, q, and r prime, and p >= q:

2^2 + 2^2 + 23,

3^3 + 3^3 + 13,

5^2 + 2^2 + 2.

CROSSREFS

Cf. A212292.

Sequence in context: A274659 A274661 A225089 * A093998 A247918 A237203

Adjacent sequences:  A262433 A262434 A262435 * A262437 A262438 A262439

KEYWORD

nonn

AUTHOR

Peter Kagey, Sep 22 2015

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 July 5 16:07 EDT 2020. Contains 335473 sequences. (Running on oeis4.)