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

A342957 a(n) is the least k such that A342956(k) = n.

Original entry on oeis.org

1, 2, 4, 15, 39, 87, 183, 951, 1255, 1527, 3063, 15335, 12279, 61431, 49143, 516047, 491495, 1703767, 1310695, 8257487, 3145719, 15728631, 12582903, 94371815, 50331639, 352321527, 335544295
Offset: 0

Views

Author

J. M. Bergot and Robert Israel, Mar 30 2021

Keywords

Comments

a(n) exists for all n, as A342956(2^(2^k)) = k+1.
If 2^n = p+q where p and q are primes, then A342956(p*q) = n so a(n) <= p*q <= 2^(2*n-2). Goldbach's conjecture implies such p and q exist for all n >= 2.

Examples

			a(3) = 15 because A342956(15) = 3 and this is the first appearance of the value 3 in A342956.
		

Crossrefs

Cf. A342956.

Programs

  • Maple
    f:= proc(n) local t; numtheory:-bigomega(add(t[1]*t[2], t=ifactors(n)[2])) end proc:
    V:= Array(0..18): count:= 0:
    for n from 0 while count < 19 do
    v:= f(n):
    if v <= 19 and V[v] = 0 then
        count:= count+1; V[v]:= n
    fi
    od:
    convert(V,list);
  • Mathematica
    Table[n=0;While[PrimeOmega[Plus@@Times@@@FactorInteger@++n]!=k];n,{k,0,14}] (* Giorgos Kalogeropoulos, Aug 20 2021 *)

Extensions

a(25)-a(26) from Chai Wah Wu, Mar 31 2021

A373976 a(n) = A001222(n) - A001222(A001414(n)), where A001222 is bigomega, the number of prime factors with multiplicity, and A001414 is sopfr, sum of prime factors with multiplicity. a(1) = 0 by convention.

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 2, 0, 0, -1, 1, 0, 0, 0, 1, 0, 1, 0, 2, 0, 0, 1, 2, 0, 1, 0, 3, 0, 1, -1, 2, 0, 0, -2, 3, 0, 0, 0, 1, 2, 0, 0, 4, 0, 0, -1, 2, 0, 3, -2, 3, 0, 1, 0, 1, 0, 0, 2, 3, -1, -1, 0, 1, 0, 1, 0, 2, 0, 0, 2, 2, -1, 0, 0, 4, 1, 1, 0, 2, 0, -1, -3, 3, 0, 3, -1, 0, 0, 0, -2, 5, 0, -1, 2, 2, 0
Offset: 1

Views

Author

Antti Karttunen, Jun 24 2024

Keywords

Crossrefs

Cf. also A045835.

Programs

Formula

a(n) = A001222(n) - A342956(n).
Showing 1-2 of 2 results.