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.

A367407 a(n) = sqrt(A367406(n)).

Original entry on oeis.org

1, 2, 3, 5, 6, 7, 4, 10, 11, 13, 14, 15, 17, 19, 21, 22, 23, 12, 26, 9, 29, 30, 31, 8, 33, 34, 35, 37, 38, 39, 20, 41, 42, 43, 46, 47, 51, 53, 18, 55, 28, 57, 58, 59, 61, 62, 65, 66, 67, 69, 70, 71, 73, 74, 77, 78, 79, 82, 83, 85, 86, 87, 44, 89, 91, 93, 94, 95, 24, 97
Offset: 1

Views

Author

Amiram Eldar, Nov 17 2023

Keywords

Comments

A permutation of the positive integers.

Crossrefs

Programs

  • Mathematica
    s[n_] := Sqrt[n * Times @@ FactorInteger[n][[;;, 1]]]; s /@ Select[Range[100], AllTrue[FactorInteger[#][[;; , 2]], OddQ] &]
  • PARI
    b(n) = {my(f = factor(n)); prod(i = 1, #f~, if(f[i,2]%2, f[i,1]^(f[i,2]+1), 0));}
    lista(kmax) = {my(b1); for(k = 1, kmax, b1 = b(k); if(b1 > 0, print1(sqrtint(b1), ", ")));}

Formula

a(n) = sqrt(A064549(A268335(n))).
a(n) = sqrt(A268335(n)*A367417(n)).
a(n) = A268335(n)/A367419(n).
Sum_{k=1..n} a(k) = c * n^2 / 2, where c = (zeta(3)/(zeta(2)*d^2)) * Product_{p prime} (1 - 1/(p^2*(p+1))) = A253905 * A065465 / d^3 = 1.29812028442810841122..., and d = A065463 is the asymptotic density of the exponentially odd numbers (A268335).