Sequences
392,541 sequences
- Primes of the form k^2 + prime(k) + 1.A063461
Primes of the form k^2 + prime(k) + 1.
- a(n) = n * last digit of n.A063462
a(n) = n * last digit of n.
- Squarefree numbers arising in A024110.A063463
Squarefree numbers arising in A024110.
- Numbers k such that omega(k) = omega(k+2), where omega(k) is the number of distinct prime divisors of k.A063464
Numbers k such that omega(k) = omega(k+2), where omega(k) is the number of distinct prime divisors of k.
- Number k such that omega(k) = omega(k+3), where omega(k) is the number of distinct prime divisors of k.A063465
Number k such that omega(k) = omega(k+3), where omega(k) is the number of distinct prime divisors of k.
- Numbers k such that 2*phi(k) + 8 = sigma(k).A063466
Numbers k such that 2*phi(k) + 8 = sigma(k).
- Number of idempotent reversible binary (i.e., radius one half) cellular automata of order n. Equivalently, number of loop-noded symmetric 2-colored unique 2-path graphs on n nodes. Equivalently, number of idempotent semicentral bigroupoids of order n.A063467
Number of idempotent reversible binary (i.e., radius one half) cellular automata of order n. Equivalently, number of loop-noded symmetric 2-colored unique 2-path graphs on n nodes. Equivalently, number of idempotent semicentral bigroupoids of order n.
- Number of Pythagorean triples in the range [1..n], i.e., the number of integer solutions to x^2 + y^2 = z^2 with 1 <= x,y,z <= n.A063468
Number of Pythagorean triples in the range [1..n], i.e., the number of integer solutions to x^2 + y^2 = z^2 with 1 <= x,y,z <= n.
- Numbers n such that tau(n)*3 = phi(n).A063469
Numbers n such that tau(n)*3 = phi(n).
- Numbers n such that tau(n)*4 = phi(n).A063470
Numbers n such that tau(n)*4 = phi(n).
- Continued fraction for sqrt(2) / zeta(2).A063471
Continued fraction for sqrt(2) / zeta(2).
- Primes of the form 666*k - 1.A063472
Primes of the form 666*k - 1.
- a(n) = M(2*n-1), where M(n) is Mertens's function (A002321): Sum_{k=1..n} mu(k), where mu = Moebius function (A008683).A063473
a(n) = M(2*n-1), where M(n) is Mertens's function (A002321): Sum_{k=1..n} mu(k), where mu = Moebius function (A008683).
- Half totient of 2^n+1.A063474
Half totient of 2^n+1.
- Sum_{d | H(n)} d^2, where H(n) is the Half-Totient function (A023022).A063475
Sum_{d | H(n)} d^2, where H(n) is the Half-Totient function (A023022).
- Sum_{d |C(n)} d^2, where C(n) is the Cototient function n - phi(n) (A051953).A063476
Sum_{d |C(n)} d^2, where C(n) is the Cototient function n - phi(n) (A051953).
- a(n) is the sum of the divisors of Fibonacci(n) (A000045).A063477
a(n) is the sum of the divisors of Fibonacci(n) (A000045).
- a(n) = Sum_{d|Fibonacci(n)} d^2.A063478
a(n) = Sum_{d|Fibonacci(n)} d^2.
- Numbers k such that omega(k+1) = 2*omega(k), where omega is the number of distinct prime factors.A063479
Numbers k such that omega(k+1) = 2*omega(k), where omega is the number of distinct prime factors.
- C(n+3)=2*C(n), where C(n) is Cototient(n) := n - phi(n) (A051953).A063480
C(n+3)=2*C(n), where C(n) is Cototient(n) := n - phi(n) (A051953).
- a(n) = 4^n + 8^n.A063481
a(n) = 4^n + 8^n.
- a(n) = prime(n) * last digit of prime(n).A063482
a(n) = prime(n) * last digit of prime(n).
- S[A002808(n)] where S[] is Boris Stechkin's function (A055004) and A002808(n) are the composites.A063483
S[A002808(n)] where S[] is Boris Stechkin's function (A055004) and A002808(n) are the composites.
- Numbers k such that Omega(k+1) = 2*Omega(k), where Omega(k) is the number of prime divisors of k (with repetition).A063484
Numbers k such that Omega(k+1) = 2*Omega(k), where Omega(k) is the number of prime divisors of k (with repetition).
- Composites of the form 2^(2^k)+3.A063485
Composites of the form 2^(2^k)+3.
- a(n) = 2^(2^n) + 5.A063486
a(n) = 2^(2^n) + 5.
- Number of distinct prime divisors of 2^(2^n)-1 (A051179).A063487
Number of distinct prime divisors of 2^(2^n)-1 (A051179).
- a(n) = (2*n-1)*(n^2 -n +2)/2.A063488
a(n) = (2*n-1)*(n^2 -n +2)/2.
- a(n) = (2*n-1)*(5*n^2-5*n+6)/6.A063489
a(n) = (2*n-1)*(5*n^2-5*n+6)/6.
- a(n) = (2*n - 1)*(7*n^2 - 7*n + 6)/6.A063490
a(n) = (2*n - 1)*(7*n^2 - 7*n + 6)/6.
- a(n) = (2*n - 1)*(3*n^2 - 3*n + 2)/2.A063491
a(n) = (2*n - 1)*(3*n^2 - 3*n + 2)/2.
- a(n) = (2*n - 1)*(11*n^2 - 11*n + 6)/6.A063492
a(n) = (2*n - 1)*(11*n^2 - 11*n + 6)/6.
- a(n) = (2*n-1)*(13*n^2-13*n+6)/6.A063493
a(n) = (2*n-1)*(13*n^2-13*n+6)/6.
- a(n) = (2*n - 1)*(7*n^2 - 7*n + 3)/3.A063494
a(n) = (2*n - 1)*(7*n^2 - 7*n + 3)/3.
- a(n) = (2*n-1)*(5*n^2-5*n+2)/2.A063495
a(n) = (2*n-1)*(5*n^2-5*n+2)/2.
- a(n) = (2*n - 1)*(8*n^2 - 8*n + 3)/3.A063496
a(n) = (2*n - 1)*(8*n^2 - 8*n + 3)/3.
- Number of atoms in first n shells of type I hyperfullerene.A063497
Number of atoms in first n shells of type I hyperfullerene.
- Number of atoms in cluster of n layers around C_60.A063498
Number of atoms in cluster of n layers around C_60.
- Primes of the form prime(n) + n!.A063499
Primes of the form prime(n) + n!.
- a(n) is the least composite solution of phi(k + 6n) = phi(k) + 6n.A063500
a(n) is the least composite solution of phi(k + 6n) = phi(k) + 6n.
- Number of prime-sextuplets up to 10^n.A063501
Number of prime-sextuplets up to 10^n.
- a(n+1) = p, where p is the a(n)-th twin prime (p,p+2), with a(0) = 1.A063502
a(n+1) = p, where p is the a(n)-th twin prime (p,p+2), with a(0) = 1.
- Continued fraction for e^Pi - Pi^e (A063504 = A039661 - A059850).A063503
Continued fraction for e^Pi - Pi^e (A063504 = A039661 - A059850).
- Decimal expansion of e^Pi - Pi^e.A063504
Decimal expansion of e^Pi - Pi^e.
- Erroneous version of A008964.A063505
Erroneous version of A008964.
- a(n) = phi(a(n-1)) * number of divisors of a(n-1), a(1)=3.A063506
a(n) = phi(a(n-1)) * number of divisors of a(n-1), a(1)=3.
- Least k such that k - phi(k) = n, or 0 if no such k exists.A063507
Least k such that k - phi(k) = n, or 0 if no such k exists.
- Numbers n such that !n + 2n - 1 is prime.A063508
Numbers n such that !n + 2n - 1 is prime.
- Squarefree Lucas numbers.A063509
Squarefree Lucas numbers.
- a(1) = 1, a(n) = a(floor(square root(n))) + 1 for n > 1.A063510
a(1) = 1, a(n) = a(floor(square root(n))) + 1 for n > 1.