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!)
A333167 a(n) = r_2(n^2 + 1), where r_2(k) is the number of ways of writing k as a sum of 2 squares (A004018). 4
4, 4, 8, 8, 8, 8, 8, 12, 16, 8, 8, 8, 16, 16, 8, 8, 8, 16, 24, 8, 8, 16, 16, 16, 8, 8, 8, 16, 16, 8, 16, 16, 24, 16, 16, 8, 8, 16, 24, 8, 8, 12, 16, 24, 16, 8, 16, 32, 16, 8, 16, 8, 16, 16, 8, 16, 8, 32, 16, 8, 16, 8, 16, 16, 16, 8, 8, 16, 32, 8, 24, 8, 32, 32 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
REFERENCES
Steven R. Finch, Mathematical Constants II, Encyclopedia of Mathematics and Its Applications, Cambridge University Press, Cambridge, 2018, p. 166.
LINKS
E. J. Scourfield, The divisors of a quadratic polynomial, Glasgow Mathematical Journal, Vol. 5, No. 1 (1961), pp. 8-20.
FORMULA
a(n) = A004018(A002522(n)).
EXAMPLE
a(0) = r_2(0^2 + 1) = r_2(1) = A004018(1) = 4.
MATHEMATICA
Table[SquaresR[2, k^2 + 1], {k, 0, 100}]
CROSSREFS
Sequence in context: A264606 A016712 A346062 * A246066 A076359 A105675
KEYWORD
nonn
AUTHOR
Amiram Eldar, Mar 09 2020
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 April 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)