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-1 of 1 results.

A343035 a(n) = A343033(n, n).

Original entry on oeis.org

1, 2, 5, 4, 11, 30, 17, 8, 25, 110, 23, 60, 31, 238, 385, 16, 41, 150, 47, 220, 935, 506, 59, 120, 121, 806, 125, 476, 67, 2310, 73, 32, 1495, 1394, 2431, 900, 83, 1786, 2635, 440, 97, 39270, 103, 1012, 1925, 2714, 109, 240, 289, 1210, 3895, 1612, 127, 750
Offset: 1

Views

Author

Rémy Sigrist, Apr 03 2021

Keywords

Comments

This sequence has similarities with A087019.

Examples

			For n = 40:
- 40 = 5 * 2^3, so:
          (11 7 5 3 2)
                1 0 3
              x 1 0 3
              -------
                1 0 3
              0 0 0
          + 1 0 1
          -----------
            1 0 1 0 3,
- hence a(40) = 11 * 5 * 2^3 = 440.
		

Crossrefs

Programs

  • PARI
    a(n) = { my (r=1, pp=factor(n)[, 1]~); for (i=1, #pp, for (j=1, #pp, my (p=prime(primepi(pp[i])+primepi(pp[j])-1), v=valuation(r, p), w=min(valuation(n, pp[i]), valuation(n, pp[j]))); if (w>v, r*=p^(w-v)))); r }

Formula

a(n) = n iff n is a power of 2 (A000079).
a(prime(i)^k) = prime(2*i-1)^k for any i > 0 and k > 0.
Showing 1-1 of 1 results.