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.

A175908 3*sum(k=1..n, floor(k^2/n)) - n^2.

Original entry on oeis.org

2, 2, 3, 5, 2, 3, 5, 8, 6, 2, 5, 9, 2, 5, 9, 14, 2, 6, 5, 11, 6, 5, 11, 18, 8, 2, 9, 11, 2, 9, 11, 20, 6, 2, 11, 21, 2, 5, 15, 20, 2, 6, 5, 17, 12, 11, 17, 30, 14, 8, 9, 11, 2, 9, 17, 26, 6, 2, 11, 27, 2, 11, 21, 32, 2, 6, 5, 17, 12, 11, 23, 36, 2, 2, 21, 17, 8, 15, 17, 38
Offset: 1

Views

Author

John W. Layman, Oct 14 2010

Keywords

Comments

According to the reference, a(p*q) = a(p) + a(q) - 2 whenever p and q are distinct primes with p congruent to q modulo 4.
The sequences of indices n where a(n)=2 is {1, 2, 5, 10, 13, 17, 26, ...}, which appears to be A020893 (squarefree sums of two squares). This has been confirmed for the first 500 terms. [John W. Layman, May 16 2011]

Crossrefs

Cf. A020893.

Programs

Formula

a(n) = 3*A014817(n) - A000290(n). - Wesley Ivan Hurt, Jul 10 2014