Sequences
392,541 sequences
- a(A086957(n))=A086959(n), a(A086958(n))=A086957(n), a(A086959(n))=A086958(n), see A086956.A086961
a(A086957(n))=A086959(n), a(A086958(n))=A086957(n), a(A086959(n))=A086958(n), see A086956.
- a(A086957(n))=A086957(n), a(A086958(n))=A086959(n), a(A086959(n))=A086958(n), see A086956.A086962
a(A086957(n))=A086957(n), a(A086958(n))=A086959(n), a(A086959(n))=A086958(n), see A086956.
- a(A086957(n))=A086959(n), a(A086958(n))=A086958(n), a(A086959(n))=A086957(n), see A086956.A086963
a(A086957(n))=A086959(n), a(A086958(n))=A086958(n), a(A086959(n))=A086957(n), see A086956.
- a(A086957(n))=A086958(n), a(A086958(n))=A086957(n), a(A086959(n))=A086959(n), see A086956.A086964
a(A086957(n))=A086958(n), a(A086958(n))=A086957(n), a(A086959(n))=A086959(n), see A086956.
- Number of distinct zeros of x^3-x-1 mod prime(n).A086965
Number of distinct zeros of x^3-x-1 mod prime(n).
- Number of distinct zeros of x^4-x-1 mod prime(n).A086966
Number of distinct zeros of x^4-x-1 mod prime(n).
- Number of distinct zeros of x^5-x-1 mod prime(n).A086967
Number of distinct zeros of x^5-x-1 mod prime(n).
- Numbers n such that n^2 is a sum k-th prime + k for some k.A086968
Numbers n such that n^2 is a sum k-th prime + k for some k.
- Duplicate of A014692.A086969
Duplicate of A014692.
- Fix 1, then exchange the subsequent odd numbers in pairs.A086970
Fix 1, then exchange the subsequent odd numbers in pairs.
- Number of semiprime divisors of n.A086971
Number of semiprime divisors of n.
- a(n) = n*3^(n-1) + (3^n + 1)/2.A086972
a(n) = n*3^(n-1) + (3^n + 1)/2.
- Period of oscillator reached starting with a segment of n consecutive live cells and applying the LongLife 2D rule (see comment).A086973
Period of oscillator reached starting with a segment of n consecutive live cells and applying the LongLife 2D rule (see comment).
- Numbers of the form p^2 * q * r with distinct primes p, q and r such that p^2 < q*r.A086974
Numbers of the form p^2 * q * r with distinct primes p, q and r such that p^2 < q*r.
- Numbers of the form p^2 * q * r with primes p < q < r.A086975
Numbers of the form p^2 * q * r with primes p < q < r.
- Number of monotonic matrices of order n.A086976
Number of monotonic matrices of order n.
- Increasing peaks in the prime gap sequence A000230.A086977
Increasing peaks in the prime gap sequence A000230.
- Increasing peaks in the prime gap sequence A001632.A086978
Increasing peaks in the prime gap sequence A001632.
- Increasing peaks in the prime gap sequence A038664.A086979
Increasing peaks in the prime gap sequence A038664.
- Late occurring prime gaps in the prime gap sequence A001223.A086980
Late occurring prime gaps in the prime gap sequence A001223.
- a(n) = smallest k where (10^k+1)=0 mod prime(n)^2, or 0 if no such k exists.A086981
a(n) = smallest k where (10^k+1)=0 mod prime(n)^2, or 0 if no such k exists.
- Numbers n such that 10^n+1 is not squarefree.A086982
Numbers n such that 10^n+1 is not squarefree.
- Primes of the form 2^r*p^s - 1, where p is an odd prime.A086983
Primes of the form 2^r*p^s - 1, where p is an odd prime.
- Number of arrangements of n labeled balls in n labeled columns where only 1 column may have more than 1 ball.A086984
Number of arrangements of n labeled balls in n labeled columns where only 1 column may have more than 1 ball.
- a(n) = A000407(n) - A086984(n).A086985
a(n) = A000407(n) - A086984(n).
- Numbers j such that sigma(j) can be represented as Sum_{i=0..k} sigma(m+i), with k>0.A086986
Numbers j such that sigma(j) can be represented as Sum_{i=0..k} sigma(m+i), with k>0.
- a(n) = A000203(A086986(n)).A086987
a(n) = A000203(A086986(n)).
- Sum of odd indexed divisors of n.A086988
Sum of odd indexed divisors of n.
- Sum of even-indexed divisors of n.A086989
Sum of even-indexed divisors of n.
- Expansion of (1+4x-sqrt(1+4x^2))/(4+6x) in powers of x.A086990
Expansion of (1+4x-sqrt(1+4x^2))/(4+6x) in powers of x.
- Numbers of claw-free simple graphs (not necessarily connected) on n nodes.A086991
Numbers of claw-free simple graphs (not necessarily connected) on n nodes.
- Product of nonzero digits in n-th row of Pascal's triangle.A086992
Product of nonzero digits in n-th row of Pascal's triangle.
- Number of generations needed to reach an oscillator, starting with a segment of n consecutive live cells and applying the LongLife 2D rule (see comment).A086993
Number of generations needed to reach an oscillator, starting with a segment of n consecutive live cells and applying the LongLife 2D rule (see comment).
- Decimal expansion of Pi written in base 2.A086994
Decimal expansion of Pi written in base 2.
- Number of 1's in binary representation of n-th decimal digit in expansion of Pi.A086995
Number of 1's in binary representation of n-th decimal digit in expansion of Pi.
- Decimal expansion of e (A001113) written in base 2.A086996
Decimal expansion of e (A001113) written in base 2.
- Number of 1's in binary representation of n-th decimal digit in expansion of e.A086997
Number of 1's in binary representation of n-th decimal digit in expansion of e.
- Duplicate of A028416.A086998
Duplicate of A028416.
- Periodic part of decimal expansion of 1/p for those primes having a periodic part of even length.A086999
Periodic part of decimal expansion of 1/p for those primes having a periodic part of even length.
- Half length of periodic part of decimal expansion of 1/p for those primes having a periodic part of even length.A087000
Half length of periodic part of decimal expansion of 1/p for those primes having a periodic part of even length.
- Left half of periodic part of decimal expansion of 1/p for those primes having a periodic part of even length.A087001
Left half of periodic part of decimal expansion of 1/p for those primes having a periodic part of even length.
- Right half of periodic part of decimal expansion of 1/p for those primes having a periodic part of even length.A087002
Right half of periodic part of decimal expansion of 1/p for those primes having a periodic part of even length.
- a(2n) = 0 and a(2n+1) = mu(2n+1); also the sum of Mobius function values computed for terms of 3x+1 trajectory started at n, provided that Collatz conjecture is true.A087003
a(2n) = 0 and a(2n+1) = mu(2n+1); also the sum of Mobius function values computed for terms of 3x+1 trajectory started at n, provided that Collatz conjecture is true.
- Numbers whose number of divisors equals the sum of their separate prime-power decompositions.A087004
Numbers whose number of divisors equals the sum of their separate prime-power decompositions.
- Divisors of 2310.A087005
Divisors of 2310.
- Divisors of 30030.A087006
Divisors of 30030.
- Divisors of 510510.A087007
Divisors of 510510.
- Divisors of 9699690.A087008
Divisors of 9699690.
- Least m such that omega(m) + Omega(m) = n, or 0 if no such m exists.A087009
Least m such that omega(m) + Omega(m) = n, or 0 if no such m exists.
- Number of primes of form 4*k+1 between n and 2n (inclusive).A087010
Number of primes of form 4*k+1 between n and 2n (inclusive).