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.

Previous Showing 11-13 of 13 results.

A328473 a(n) = A276156(n) - A002110(A007814(n)).

Original entry on oeis.org

0, 0, 2, 0, 6, 6, 8, 0, 30, 30, 32, 30, 36, 36, 38, 0, 210, 210, 212, 210, 216, 216, 218, 210, 240, 240, 242, 240, 246, 246, 248, 0, 2310, 2310, 2312, 2310, 2316, 2316, 2318, 2310, 2340, 2340, 2342, 2340, 2346, 2346, 2348, 2310, 2520, 2520, 2522, 2520, 2526, 2526, 2528, 2520, 2550, 2550, 2552, 2550, 2556, 2556, 2558, 0, 30030
Offset: 1

Views

Author

Antti Karttunen, Oct 18 2019

Keywords

Comments

A276156(n) converts the binary expansion of n to a number whose primorial base representation has the same digits of 0's and 1's, thus each one of its terms is a unique sum of distinct primorial numbers. This sequence is otherwise similar, but the primorial number corresponding to the least significant 1-bit of n is dropped from the sum, so the sum is not unique anymore.

Crossrefs

Programs

  • PARI
    A002110(n) = prod(i=1,n,prime(i));
    A276156(n) = { my(p=2,pr=1,s=0); while(n,if(n%2,s += pr); n >>= 1; pr *= p; p = nextprime(1+p)); (s); };
    A328473(n) = (A276156(n)-A002110(valuation(n,2)));

Formula

a(n) = A276156(A129760(n)).
a(n) = A276151(A276156(n)) = A276156(n) - A002110(A007814(n)).

A324384 a(n) = gcd(n, A276154(n)), where A276154 is the primorial base left shift.

Original entry on oeis.org

0, 1, 2, 1, 4, 1, 6, 1, 4, 1, 2, 11, 12, 1, 2, 1, 8, 1, 18, 1, 4, 7, 2, 1, 24, 1, 2, 1, 4, 1, 30, 1, 8, 1, 2, 7, 12, 1, 2, 1, 4, 1, 6, 1, 4, 1, 2, 1, 12, 1, 2, 1, 52, 1, 6, 1, 56, 1, 2, 1, 60, 1, 2, 1, 16, 1, 6, 1, 4, 1, 14, 1, 24, 1, 2, 1, 4, 1, 6, 1, 4, 1, 2, 1, 12, 1, 2, 1, 8, 1, 90, 1, 4, 1, 2, 1, 12, 1, 2, 1, 4, 1, 6, 1, 8, 1
Offset: 0

Views

Author

Antti Karttunen, Feb 26 2019

Keywords

Comments

For a very few primes, a(p) > 1 (then by necessity a(p) = p). In range 2 .. 2^25 there are three: 2, 11, 119039.

Crossrefs

Programs

Formula

a(n) = gcd(n, A276154(n)).

A328575 a(n) = A003557(A032742(A276086(n))).

Original entry on oeis.org

1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 3, 1, 5, 5, 5, 5, 15, 5, 25, 25, 25, 25, 75, 25, 125, 125, 125, 125, 375, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 3, 1, 5, 5, 5, 5, 15, 5, 25, 25, 25, 25, 75, 25, 125, 125, 125, 125, 375, 1, 7, 7, 7, 7, 21, 7, 7, 7, 7, 7, 21, 7, 35, 35, 35, 35, 105, 35, 175, 175, 175, 175, 525, 175, 875, 875, 875, 875, 2625, 7
Offset: 0

Views

Author

Antti Karttunen, Oct 20 2019

Keywords

Crossrefs

Programs

  • PARI
    A003557(n) = { my(f=factor(n)); for (i=1, #f~, f[i, 2] = f[i, 2]-1); factorback(f); }; \\ From A003557
    A032742(n) = if(1==n,n,n/vecmin(factor(n)[,1]));
    A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
    A328575(n) = A003557(A032742(A276086(n)));

Formula

a(n) = A003557(A032742(A276086(n))).
For n >= 1, a(n) = A003557(A276086(A276151(n))).
For n >= 1, max(A276088(n),1+A051903(a(n))) = A328114(n).
Previous Showing 11-13 of 13 results.