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.

A372134 Prime shadows (A181819) linearly transformed to generate odd numbers, multiplied by 2^(A064839 - 1).

Original entry on oeis.org

-1, 1, 2, 3, 4, 5, 8, 7, 6, 10, 16, 9, 32, 20, 40, 11, 64, 18, 128, 36, 80, 160, 256, 17, 12, 320, 14, 72, 512, 13, 1024, 19, 640, 1280, 2560, 15, 2048, 5120, 10240, 34, 4096, 26, 8192, 144, 288, 20480, 16384, 25, 24, 576, 40960, 1152, 32768, 68, 81920, 136
Offset: 1

Views

Author

Friedjof Tellkamp, Apr 20 2024

Keywords

Comments

a(n>1) contains all positive integers exactly once.

Crossrefs

Programs

  • Mathematica
    z = 100; prisigs = Table[If[n == 1, {}, Sort[Last /@ FactorInteger[n]]], {n, z}];
    exps = Table[Count[Take[prisigs, n], prisigs[[n]]], {n, z}];(* A064839 *)
    Table[2^(exps[[n]] - 1) (2 Times @@ Prime[prisigs[[n]]] - 3), {n, z}]

Formula

a(n) = (2 * A181819(n) - 3) * 2^(k - 1), where k is the number of occurrences of the same prime signature of n in (1..n) (A064839).
Showing 1-1 of 1 results.