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.

Showing 1-3 of 3 results.

A181318 a(n) = A060819(n)^2.

Original entry on oeis.org

0, 1, 1, 9, 1, 25, 9, 49, 4, 81, 25, 121, 9, 169, 49, 225, 16, 289, 81, 361, 25, 441, 121, 529, 36, 625, 169, 729, 49, 841, 225, 961, 64, 1089, 289, 1225, 81, 1369, 361, 1521, 100, 1681, 441, 1849, 121, 2025, 529, 2209, 144, 2401, 625, 2601, 169, 2809, 729
Offset: 0

Views

Author

Paul Curtz, Jan 26 2011

Keywords

Comments

The first sequence, p=0, of the family A060819(n)*A060819(n+p).
Hence array
p=0: 0, 1, 1, 9, 1, 25, 9, 49, a(n)=A060819(n)^2,
p=1: 0, 1, 3, 3, 5, 15, 21, 14, A064038(n),
p=2: 0, 3, 1, 15, 3, 35, 6, 63, A198148(n),
p=3: 0, 1, 5, 9, 7, 10, 27, 35, A160050(n),
p=4: 0, 5, 3, 21, 2, 45, 15, 77, A061037(n),
p=5: 0, 3, 7, 6, 9, 25, 33, 21, A178242(n),
p=6: 0, 7, 2, 27, 5, 55, 9, 91, A217366(n),
p=7: 0, 2, 9, 15, 11, 15, 39, 49, A217367(n),
p=8: 0, 9, 5, 33, 3, 65, 21, 105, A180082(n).
Compare columns 2, 3 and 5, columns 4 and 7 and columns 6 and 8.
From Peter Bala, Feb 19 2019: (Start)
We make some general remarks about the sequence a(n) = numerator(n^2/(n^2 + k^2)) = (n/gcd(n,k))^2 for k a fixed positive integer (we suppress the dependence of a(n) on k). The present sequence corresponds to the case k = 4.
a(n) is a quasi-polynomial in n. In fact, a(n) = n^2/b(n) where b(n) = gcd(n^2,k^2) is a purely periodic sequence in n.
In addition to being multiplicative these sequences are also strong divisibility sequences, that is, gcd(a(n),a(m)) = a(gcd(n,m)) for n, m >= 1. In particular, it follows that a(n) is a divisibility sequence: if n divides m then a(n) divides a(m).
By the multiplicativeness and strong divisibility property of the sequence a(n) it follows that if gcd(n,m) = 1 then a( a(n)*a(m) ) = a(a(n)) * a(a(m)), a( a(a(n))*a(a(m)) ) = a(a(a(n))) * a(a(a(m))) and so on.
The sequence a(n) has the rational generating function Sum_{d divides k} f(d)*F(x^d), where F(x) = x*(1 + x)/(1 - x)^3 = x + 4*x^2 + 9*x^3 + 16*x^4 + ... is the o.g.f. for the squares A000290, and where f(n) is the Dirichlet inverse of the Jordan totient function J_2(n) - see A007434. The function f(n) is multiplicative and is defined on prime powers p^k by f(p^k) = (1 - p^2). See A046970. Cf. A060819. (End)
a(n-4) is the constant needed to complete the n-polygonal numbers into squares (see A377851); a(-1) = 1, which completes the triangle numbers, is not shown in the data. - Jonathan Dushoff, Nov 12 2024

Links

Crossrefs

Cf. A181829, A046970, A007434, A060819, A168077, A377851.

Programs

  • Magma
    [n^2/GCD(n,4)^2: n in [0..100]]; // G. C. Greubel, Sep 19 2018
  • Maple
    a:=n->n^2/gcd(n,4)^2: seq(a(n),n=0..60); # Muniru A Asiru, Feb 20 2019
  • Mathematica
    Table[n^2/GCD[n,4]^2, {n,0,100}] (* G. C. Greubel, Sep 19 2018 *)
LinearRecurrence[{0,0,0,3,0,0,0,-3,0,0,0,1},{0,1,1,9,1,25,9,49,4,81,25,121},60] (* Harvey P. Dale, Jan 18 2025 *)
  • PARI
    a(n)=n^2/gcd(n,4)^2 \\ Charles R Greathouse IV, Dec 21 2011
  • Sage
    [n^2/gcd(n, 4)^2 for n in (0..100)] # G. C. Greubel, Feb 20 2019

Formula

a(2*n) = A168077(n), a(2*n+1) = A016754(n).
a(n) = 3*a(n-4) - 3*a(n-8) + a(n-12).
G.f.: x*(1 + x + 9*x^2 + x^3 + 22*x^4 + 6*x^5 + 22*x^6 + x^7 + 9*x^8 + x^9 + x^10)/(1-x^4)^3. - R. J. Mathar, Mar 10 2011
From Peter Bala, Feb 19 2019: (Start)
a(n) = numerator(n^2/(n^2 + 16)) = n^2/(gcd(n^2,16)) = (n/gcd(n,4))^2.
a(n) = n^2/b(n), where b(n) = [1, 4, 1, 16, 1, 4, 1, 16, ...] is a purely periodic sequence of period 4.
a(n) is a quasi-polynomial in n: a(4*n) = n^2; a(4*n + 1) = (4*n + 1)^2; a(4*n + 2) = (2*n + 1)^2; a(4*n + 3) = (4*n + 3)^2.
O.g.f.: Sum_{d divides 4} A046970(d)*x^d*(1 + x^d)/(1 - x^d)^3 = x*(1 + x)/(1 - x)^3 - 3*x^2*(1 + x^2)/(1 - x^2)^3 - 3*x^4*(1 + x^4)/(1 - x^4)^3. (End)
Sum_{n>=1} 1/a(n) = 5*Pi^2/12. - Amiram Eldar, Aug 12 2022
From Amiram Eldar, Nov 25 2022: (Start)
Multiplicative with a(2^e) = 4^max(0, e-2), and a(p^e) = p^(2*e) for p > 2.
Dirichlet g.f.: zeta(s-2)*(1 - 3/2^s - 3/4^s).
Sum_{k=1..n} a(k) ~ (37/192) * n^3. (End)
a(n) = (37 - 27*(-1)^n - 3*(-1)^(n*(n-1)/2) - 3*(-1)^(n*(n+1)/2)) * n^2/64. - Vaclav Kotesovec, Nov 14 2024

Extensions

Edited by Jean-François Alcover, Oct 01 2012 and Jan 15 2013
More terms from Michel Marcus, Jun 09 2014

A215189 Array t(n,k) of the family ((n+k)/gcd(n+k,4))*(n/gcd(n,4)), read by antidiagonals.

Original entry on oeis.org

0, 1, 0, 1, 1, 0, 9, 3, 3, 0, 1, 3, 1, 1, 0, 25, 5, 15, 5, 5, 0, 9, 15, 3, 9, 3, 3, 0, 49, 21, 35, 7, 21, 7, 7, 0, 4, 14, 6, 10, 2, 6, 2, 2, 0, 81, 18, 63, 27, 45, 9, 27, 9, 9, 0, 25, 45, 10, 35, 15, 25, 5, 15, 5, 5, 0, 121, 55, 99, 22, 77, 33, 55, 11, 33, 11, 11, 0, 9, 33, 15, 27, 6, 21, 9, 15, 3, 9, 3, 3, 0
Offset: 0

Views

Author

Jean-François Alcover, Jun 12 2013

Keywords

Comments

Identification of rows and columns:
Row 2, n=1: A060819,
row 3, n=2: A060819 (shifted),
row 4, n=3: A068219,
row 5, n=4: A060819 (shifted),
row 6, n=5: A060819 (shifted and multiplied by 5),
row 7, n=6: A068219 (shifted),
row 8, n=7: A060819 (shifted and multiplied by 7);
column 1, k=0: A181318,
column 2, k=1: A064038,
column 3, k=2: A198148,
column 4, k=3: A160050,
column 5, k=4: A061037,
column 6, k=5: A178242,
column 7, k=6: A217366,
column 8, k=7: A217367.
This array is the transposition of the array given by Paul Curtz in the comments in A181318.

Examples

			Array begins:
   0,  0,  0,  0,  0,  0,  0, ...
   1,  1,  3,  1,  5,  3,  7, ...
   1,  3,  1,  5,  3,  7,  2, ...
   9,  3, 15,  9, 21,  6, 27, ...
   1,  5,  3,  7,  2,  9,  5, ...
  25, 15, 35, 10, 45, 25, 55, ...
   9, 21,  6, 27, 15, 33,  9, ...
  49, 14, 63, 35, 77, 21, 91, ...
  ...
Triangle begins:
    0;
    1,  0;
    1,  1,  0;
    9,  3,  3,  0;
    1,  3,  1,  1,  0;
   25,  5, 15,  5,  5,  0;
    9, 15,  3,  9,  3,  3,  0;
   49, 21, 35,  7, 21,  7,  7,  0;
    4, 14,  6, 10,  2,  6,  2,  2,  0;
   81, 18, 63, 27, 45,  9, 27,  9,  9,  0;
   25, 45, 10, 35, 15, 25,  5, 15,  5,  5,  0;
  121, 55, 99, 22, 77, 33, 55, 11, 33, 11, 11,  0;
    9, 33, 15, 27,  6, 21,  9, 15,  3,  9,  3,  3,  0;
  ...

Links

Crossrefs

Cf. A060819, A181318, A064038, A198148, A160050, A061037, A178242, A217366, A217367.

Programs

  • Magma
    /* As triangle: */ [[(n-k)/GCD(n-k, 4)*n/GCD(n, 4): k in [0..n]]: n in [0..12]]; // Bruno Berselli, Jun 13 2013
  • Mathematica
    t[n_, k_] := (n+k)/GCD[n+k, 4]*n/GCD[n, 4];  Table[t[n-k, k], {n, 0, 12}, {k, 0, n}] // Flatten

Formula

t(n,k) = ((n+k)/gcd(n+k,4))*(n/gcd(n,4)).

A227168 a(n) = gcd(2*n, n*(n+1)/2)^2.

Original entry on oeis.org

1, 1, 36, 4, 25, 9, 196, 16, 81, 25, 484, 36, 169, 49, 900, 64, 289, 81, 1444, 100, 441, 121, 2116, 144, 625, 169, 2916, 196, 841, 225, 3844, 256, 1089, 289, 4900, 324, 1369, 361, 6084, 400
Offset: 1

Views

Author

Paul Curtz, Jul 03 2013

Keywords

Comments

a(n) is defined as A062828(n)^2 for n >= 1. If we extend the sequence to n=0 and negative n by use of the recurrence that relates a(n) to a(n+12), a(n+8) and a(n+4), we obtain a(0)=0, a(-1)=4 and a(-n) = A176743(n-2)^2 for n >= 2.
Define c(n) = a(n+2) - a(n-2) for c >= 0. Because a(n) is a shuffle of three interleaved 2nd-order polynomials, c(n) is a shuffle of three interleaved 1st-order polynomials: c(n) = 4* A062828(n)*(periodically repeated 1, 8, 1, 1).
The sequence a(n) is case p=0 of the family A062828(n)*A062828(n+p):
0, 1, 1, 36, 4, 25, 9, 196, ... = a(n).
0, 1, 6, 12, 10, 15, 42, 56, ... = A130658(n)*A000217(n) = A177002(n-1)*A064038(n+1).
0, 6, 2, 30, 6, 70, 12, 126, ... = 2*A198148(n)
0, 2, 5, 18, 28, 20, 27, 70, ... = A177002(n+2)*A160050(n+1) = A014695(n+2)*A000096(n).

Links

Crossrefs

Cf. A062828, A016814, A017138, A005565, A006752, A061037, A061038.

Programs

Formula

a(n) = A062828(n)^2.
a(4n) = (4*n+1)^2; a(2n+1) = (n+1)^2; a(4n+2) = 4*(4*n+3)^2.
a(n) = 3*a(n-4) - 3*a(n-8) + a(n-12).
a(n) * (period 4: repeat 4, 1, 1, 4) = A061038(n).
A005565(n-3) = a(n+1) * A061037(n). - Corrected by R. J. Mathar, Jul 25 2013
a(n) = A130658(n-1)^2 * A181318(n). - Corrected by R. J. Mathar, Aug 01 2013
G.f.: -x*(1 + x + 36*x^2 + 4*x^3 + 22*x^4 + 6*x^5 + 88*x^6 + 4*x^7 + 9*x^8 + x^9 + 4*x^10) / ( (x-1)^3*(1+x)^3*(x^2+1)^3 ). - R. J. Mathar, Jul 20 2013
Sum_{n>=1} 1/a(n) = 47*Pi^2/192 + 3*G/8, where G is Catalan's constant (A006752). - Amiram Eldar, Aug 21 2022
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.