Sequences
392,541 sequences
- Numerator of cototient(n)/totient(n).A076511
Numerator of cototient(n)/totient(n).
- Denominator of cototient(n)/totient(n).A076512
Denominator of cototient(n)/totient(n).
- Numbers k such that 2 + 2^k + 3^k is prime.A076513
Numbers k such that 2 + 2^k + 3^k is prime.
- a(1)=1, a(n) is the smallest integer > a(n-1) such that the continued fraction for 1/a(1)+1/a(2)+....+1/a(n) contains strictly more elements than the continued fraction for 1/a(1)+1/a(2)+....+1/a(n-1).A076514
a(1)=1, a(n) is the smallest integer > a(n-1) such that the continued fraction for 1/a(1)+1/a(2)+....+1/a(n) contains strictly more elements than the continued fraction for 1/a(1)+1/a(2)+....+1/a(n-1).
- Numbers k such that 1 + 3^k + 5^k is prime.A076515
Numbers k such that 1 + 3^k + 5^k is prime.
- Primes p such that (p-1) and the period length of 1/p are both squares.A076516
Primes p such that (p-1) and the period length of 1/p are both squares.
- Partial sums of A060370 (cf. A006556).A076517
Partial sums of A060370 (cf. A006556).
- Numbers n such that Fibonacci(n) == sigma(n) (mod n).A076518
Numbers n such that Fibonacci(n) == sigma(n) (mod n).
- Numbers n such that Fibonacci(n) == prime(n) (mod n).A076519
Numbers n such that Fibonacci(n) == prime(n) (mod n).
- n appears once if n is the sum of 2 nonzero squares in 1 way, twice if n is the sum of 2 squares in 2 ways, 3 times if n is the sum of 2 squares 3 ways etc.A076520
n appears once if n is the sum of 2 nonzero squares in 1 way, twice if n is the sum of 2 squares in 2 ways, 3 times if n is the sum of 2 squares 3 ways etc.
- a(n) = floor( (n/2)*log_2(2*n/3) ).A076521
a(n) = floor( (n/2)*log_2(2*n/3) ).
- a(n) = floor( n*log_2(4*n/3) ).A076522
a(n) = floor( n*log_2(4*n/3) ).
- Maximal number of halving lines for 2n points in plane.A076523
Maximal number of halving lines for 2n points in plane.
- For each solution x>0 to 3*prime(n)+2*x = prime(n+2+x), the sequence lists prime(n) once.A076524
For each solution x>0 to 3*prime(n)+2*x = prime(n+2+x), the sequence lists prime(n) once.
- Numbers n such that sopf(n) = sopf(n+1) - sopf(n-1), where sopf(x) = sum of the distinct prime factors of x.A076525
Numbers n such that sopf(n) = sopf(n+1) - sopf(n-1), where sopf(x) = sum of the distinct prime factors of x.
- a(n) = r * max(e_1, ..., e_r), where n = p_1^e_1 . .... p_r^e_r is the canonical prime factorization of n, a(1) = 0.A076526
a(n) = r * max(e_1, ..., e_r), where n = p_1^e_1 . .... p_r^e_r is the canonical prime factorization of n, a(1) = 0.
- Numbers n such that sopf(n) = sopf(n-1) - sopf(n-2), where sopf(x) = sum of the distinct prime factors of x.A076527
Numbers n such that sopf(n) = sopf(n-1) - sopf(n-2), where sopf(x) = sum of the distinct prime factors of x.
- Numbers n such that sigma(n) = sigma(n-1) - sigma(n-2).A076528
Numbers n such that sigma(n) = sigma(n-1) - sigma(n-2).
- Numbers k for which phi(k) = phi(k+1) - phi(k-1).A076529
Numbers k for which phi(k) = phi(k+1) - phi(k-1).
- Numbers n such that sigma(n) = sigma(n+1) - sigma(n-1).A076530
Numbers n such that sigma(n) = sigma(n+1) - sigma(n-1).
- Numbers n such that sopf(phi(n)) = phi(sopf(n)), where sopf(x) = sum of the distinct prime factors of x.A076531
Numbers n such that sopf(phi(n)) = phi(sopf(n)), where sopf(x) = sum of the distinct prime factors of x.
- Numbers n such that sopf(sigma(n)) = sigma(sopf(n)), where sopf(x) = sum of the distinct prime factors of x.A076532
Numbers n such that sopf(sigma(n)) = sigma(sopf(n)), where sopf(x) = sum of the distinct prime factors of x.
- Numbers n such that sum of the distinct prime factors of phi(n) = sum of the distinct prime factors of sigma(n).A076533
Numbers n such that sum of the distinct prime factors of phi(n) = sum of the distinct prime factors of sigma(n).
- Let P(n,x) be defined by P(1,x)=P(2,x)=x, P(n,x)=P(n-1,x)*P(n-2,x)+1; then a(n) is the maximum element among coefficients of P(n,x) of degree F(n) (where F(n) denotes the n-th Fibonacci number).A076534
Let P(n,x) be defined by P(1,x)=P(2,x)=x, P(n,x)=P(n-1,x)*P(n-2,x)+1; then a(n) is the maximum element among coefficients of P(n,x) of degree F(n) (where F(n) denotes the n-th Fibonacci number).
- a(n) = A064405 (2^m+n) - 2^m (for m large enough this difference appears to be constant).A076535
a(n) = A064405 (2^m+n) - 2^m (for m large enough this difference appears to be constant).
- Image of n at the third step in the 3x+1 Problem: syr(3,n).A076536
Image of n at the third step in the 3x+1 Problem: syr(3,n).
- Map positive rational numbers to positive integers by diagonal method using c(p,q) = (p + q - 2) * (p + q - 1) / 2 + p where p and q are positive integers. a(n) is an increasing sequence including all c(p,q) where gcd(p,q) > 1.A076537
Map positive rational numbers to positive integers by diagonal method using c(p,q) = (p + q - 2) * (p + q - 1) / 2 + p where p and q are positive integers. a(n) is an increasing sequence including all c(p,q) where gcd(p,q) > 1.
- Numerators a(n) of fractions slowly converging to e: let a(1) = 0, b(n) = n - a(n); if (a(n) + 1) / b(n) < e then a(n+1) = a(n) + 1, else a(n+1)= a(n).A076538
Numerators a(n) of fractions slowly converging to e: let a(1) = 0, b(n) = n - a(n); if (a(n) + 1) / b(n) < e then a(n+1) = a(n) + 1, else a(n+1)= a(n).
- Numerators a(n) of fractions slowly converging to Pi: let a(1) = 0, b(n) = n - a(n); if (a(n) + 1) / b(n) < Pi, then a(n+1) = a(n) + 1, otherwise a(n+1) = a(n).A076539
Numerators a(n) of fractions slowly converging to Pi: let a(1) = 0, b(n) = n - a(n); if (a(n) + 1) / b(n) < Pi, then a(n+1) = a(n) + 1, otherwise a(n+1) = a(n).
- Number of branches in all ordered trees with n edges.A076540
Number of branches in all ordered trees with n edges.
- a(n) = Sum_{k=1..n} C(n,k) mod k.A076541
a(n) = Sum_{k=1..n} C(n,k) mod k.
- Numbers n such that A068340(n) = +-1.A076542
Numbers n such that A068340(n) = +-1.
- a(n) = Sum_{k=1..n} k*sqf(k) where sqf(k)=1 if k is squarefree and sqf(k)=-1 otherwise.A076543
a(n) = Sum_{k=1..n} k*sqf(k) where sqf(k)=1 if k is squarefree and sqf(k)=-1 otherwise.
- a(n) = mu(n) + sqf(n) where mu(n) is Moebius function, sqf(n) = 1 if n is squarefree and sqf(n) = -1 otherwise.A076544
a(n) = mu(n) + sqf(n) where mu(n) is Moebius function, sqf(n) = 1 if n is squarefree and sqf(n) = -1 otherwise.
- a(n) = Sum_{k=1..n} (mu(k) + sqf(k)) where mu(k) is Moebius function, sqf(k)=1 if k is squarefree and sqf(k)=-1 otherwise.A076545
a(n) = Sum_{k=1..n} (mu(k) + sqf(k)) where mu(k) is Moebius function, sqf(k)=1 if k is squarefree and sqf(k)=-1 otherwise.
- Let P = { p_1 = 3, p_2 = 5, ...} be the set of odd primes. If p_n in P can be written as p_n = q+r+s with q, r, s in P, let a(n) = largest such q, otherwise let a(n) = p_{n+1}.A076546
Let P = { p_1 = 3, p_2 = 5, ...} be the set of odd primes. If p_n in P can be written as p_n = q+r+s with q, r, s in P, let a(n) = largest such q, otherwise let a(n) = p_{n+1}.
- a(n) = (2^n-1-numerator(B(2^(n+1))))/2^n where numerator(B(k)) denotes the numerator of the k-th Bernoulli number.A076547
a(n) = (2^n-1-numerator(B(2^(n+1))))/2^n where numerator(B(k)) denotes the numerator of the k-th Bernoulli number.
- Let P(n,x) be defined as follows: P(1,x)=x, P(n,x)=P(n-1,x)^2+1, sequence gives maximum value of coefficients of P(n,x).A076548
Let P(n,x) be defined as follows: P(1,x)=x, P(n,x)=P(n-1,x)^2+1, sequence gives maximum value of coefficients of P(n,x).
- Numerator of (2n+1)(2n+2) B_{2n}, where B_n are the Bernoulli numbers. Also numerators of the asymptotic expansion of the polygamma function psi'''(z).A076549
Numerator of (2n+1)(2n+2) B_{2n}, where B_n are the Bernoulli numbers. Also numerators of the asymptotic expansion of the polygamma function psi'''(z).
- Indices of triangular numbers listed in A075088.A076550
Indices of triangular numbers listed in A075088.
- Smallest triangular number with n prime factors (counted without multiplicity).A076551
Smallest triangular number with n prime factors (counted without multiplicity).
- a(n) = (-1)^(n+1)/3/(2n+1) * Sum_{k=0..n} 16^k*B(2k)*C(2n+1,2k) where B(k) denotes the k-th Bernoulli number.A076552
a(n) = (-1)^(n+1)/3/(2n+1) * Sum_{k=0..n} 16^k*B(2k)*C(2n+1,2k) where B(k) denotes the k-th Bernoulli number.
- Decimal expansion of the solution of agm(x,2) = 1.A076553
Decimal expansion of the solution of agm(x,2) = 1.
- a(n) = (-1)^(n+1)/(2n+1) * Sum_{k=0..n} 64^k*B(2k)*C(2n+1,2k) where B(k) denotes the k-th Bernoulli number.A076554
a(n) = (-1)^(n+1)/(2n+1) * Sum_{k=0..n} 64^k*B(2k)*C(2n+1,2k) where B(k) denotes the k-th Bernoulli number.
- Greatest prime divisor of n-th prime + 2.A076555
Greatest prime divisor of n-th prime + 2.
- Greatest prime divisor of n-th prime + n.A076556
Greatest prime divisor of n-th prime + n.
- Greatest prime divisor of (n-th prime - n).A076557
Greatest prime divisor of (n-th prime - n).
- a(n) = r * min(e_1, ..., e_r), where n = p_1^e_1 . .... p_r^e_r is the canonical prime factorization of n, a(1) = 0.A076558
a(n) = r * min(e_1, ..., e_r), where n = p_1^e_1 . .... p_r^e_r is the canonical prime factorization of n, a(1) = 0.
- Greatest prime divisor of n-th interprime: (prime(n) + prime(n+1))/2.A076559
Greatest prime divisor of n-th interprime: (prime(n) + prime(n+1))/2.
- a(1)=1; a(n>1)= greatest prime divisor of (a(n-1) + n).A076560
a(1)=1; a(n>1)= greatest prime divisor of (a(n-1) + n).