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.

A085263 Number of ways to write n as the sum of a squarefree number (A005117) and a positive square (A000290).

Original entry on oeis.org

0, 1, 1, 1, 1, 2, 2, 1, 1, 2, 3, 2, 0, 3, 3, 2, 2, 3, 3, 2, 2, 3, 4, 2, 1, 4, 4, 2, 1, 5, 4, 3, 2, 2, 5, 2, 3, 6, 6, 3, 2, 6, 4, 3, 2, 5, 6, 3, 2, 5, 6, 3, 2, 4, 6, 4, 3, 4, 6, 4, 1, 7, 5, 3, 3, 7, 6, 4, 4, 6, 8, 3, 3, 6, 7, 2, 4, 8, 5, 4, 3, 7, 9, 4, 2, 8, 9, 4, 3, 6, 6, 5, 4, 7, 9, 5, 3, 8, 4, 3, 5, 9
Offset: 1

Views

Author

Reinhard Zumkeller, Jun 23 2003

Keywords

Comments

a(A085265(n))>0; a(A085266(n))=1; a(A085267(n))>1.
a(A085264(n))=n and a(i)<>n for i < A085264(n).
First occurrence of k: 2, 6, 11, 23, 30, 38, 62, 71, 83, 110, 138, 155, 182, 203, 227, 263, 302, 327, 383, 435, 447, 503, 542, 602, 635, ..., . Conjecture: For each k above, there is a finite number of terms; for example, only the two numbers 1 and 13 cannot be represented as the sum of a squarefree number and a square. The number of k terms beginning with 0: 2, 9, 19, 27, 38, 36, 57, 63, 62, 74, 94, ..., . - Robert G. Wilson v, May 16 2014

Examples

			a(11)=3:
11 = 1 + 10 = A000290(1) + A005117(7)
   = 4 + 7  = A000290(2) + A005117(6)
   = 9 + 2  = A000290(3) + A005117(2).
		

Crossrefs

Programs

  • Mathematica
    f[n_] := Count[ SquareFreeQ@# & /@ (n - Range[1, Floor[ Sqrt[ n]]]^2), True]; Array[f, 105] (* Robert G. Wilson v, May 16 2014 *)
  • PARI
    a(n) = sum(k=1, n-1, issquare(k) * issquarefree(n-k)); \\ Michel Marcus, Oct 30 2020

Formula

a(n+1) = Sum_{k=1..n} A008966(k)*A010052(n-k+1). - Reinhard Zumkeller, Nov 04 2009
a(n) < sqrt(n). - Robert G. Wilson v, May 17 2014
G.f.: (Sum_{i>=1} x^(i^2))*(Sum_{j>=1} mu(j)^2*x^j). - Ilya Gutkovskiy, Feb 06 2017