Sequences
392,541 sequences
- Let n = 2^e_2 * 3^e_3 * 5^e_5 * ... be the prime factorization of n; sequence gives n such that max{e_2, e_3, ...} is prime.A074661
Let n = 2^e_2 * 3^e_3 * 5^e_5 * ... be the prime factorization of n; sequence gives n such that max{e_2, e_3, ...} is prime.
- a(n) = Fibonacci(n+1)+cos(n*Pi/2).A074662
a(n) = Fibonacci(n+1)+cos(n*Pi/2).
- a(n) = sum of n-th row of the triangle formed by replacing each m in Pascal's triangle with the m-th prime.A074663
a(n) = sum of n-th row of the triangle formed by replacing each m in Pascal's triangle with the m-th prime.
- Number of algebraically independent elements of degree n in the algebra of symmetric polynomials in noncommuting variables.A074664
Number of algebraically independent elements of degree n in the algebra of symmetric polynomials in noncommuting variables.
- 8-digit distinct digit primes.A074665
8-digit distinct digit primes.
- Differences between successive 8-digit distinct digit primes.A074666
Differences between successive 8-digit distinct digit primes.
- Seven-digit distinct-digit primes.A074667
Seven-digit distinct-digit primes.
- Differences between successive 7-digit distinct-digit primes.A074668
Differences between successive 7-digit distinct-digit primes.
- Six-digit distinct-digit primes.A074669
Six-digit distinct-digit primes.
- Differences between successive six-digit distinct-digit primes.A074670
Differences between successive six-digit distinct-digit primes.
- Five-digit distinct-digit primes.A074671
Five-digit distinct-digit primes.
- Differences between successive five-digit distinct-digit primes.A074672
Differences between successive five-digit distinct-digit primes.
- Four-digit distinct-digit primes.A074673
Four-digit distinct-digit primes.
- Differences between successive four-digit distinct-digit primes.A074674
Differences between successive four-digit distinct-digit primes.
- Three-digit distinct-digit primes.A074675
Three-digit distinct-digit primes.
- Differences between consecutive three-digit distinct-digit primes.A074676
Differences between consecutive three-digit distinct-digit primes.
- a(n) = Sum_{i = 0..floor(n/2)} (-1)^(i + floor(n/2)) F(2*i + e), where F = A000045 (Fibonacci numbers) and e = (1-(-1)^n)/2.A074677
a(n) = Sum_{i = 0..floor(n/2)} (-1)^(i + floor(n/2)) F(2*i + e), where F = A000045 (Fibonacci numbers) and e = (1-(-1)^n)/2.
- a(n) = Sum_{j=0..floor(n/2)} (-1)^(j+floor(n/2))*S(2j+q), where S(n) are generalized tribonacci numbers (A001644) and q = (1-(-1)^n)/2.A074678
a(n) = Sum_{j=0..floor(n/2)} (-1)^(j+floor(n/2))*S(2j+q), where S(n) are generalized tribonacci numbers (A001644) and q = (1-(-1)^n)/2.
- Signature permutation of a Catalan automorphism: Rotate binary tree left if possible, otherwise swap its sides.A074679
Signature permutation of a Catalan automorphism: Rotate binary tree left if possible, otherwise swap its sides.
- Signature permutation of the seventeenth nonrecursive Catalan automorphism in table A089840. (Rotate binary tree right if possible, otherwise swap its sides.)A074680
Signature permutation of the seventeenth nonrecursive Catalan automorphism in table A089840. (Rotate binary tree right if possible, otherwise swap its sides.)
- Permutation of natural numbers induced by the Catalan bijection gmA074681! acting on the parenthesizations encoded by A014486/A063171.A074681
Permutation of natural numbers induced by the Catalan bijection gmA074681! acting on the parenthesizations encoded by A014486/A063171.
- Permutation of natural numbers induced by the Catalan bijection gmA074682! acting on the parenthesizations encoded by A014486/A063171.A074682
Permutation of natural numbers induced by the Catalan bijection gmA074682! acting on the parenthesizations encoded by A014486/A063171.
- Permutation of natural numbers induced by the Catalan Automorphism *A074683 acting on parenthesizations as encoded and ordered by A014486/A063171.A074683
Permutation of natural numbers induced by the Catalan Automorphism *A074683 acting on parenthesizations as encoded and ordered by A014486/A063171.
- Permutation of natural numbers induced by Catalan Automorphism *A074684 acting on the parenthesizations encoded by A014486/A063171.A074684
Permutation of natural numbers induced by Catalan Automorphism *A074684 acting on the parenthesizations encoded by A014486/A063171.
- Permutation of natural numbers induced by the Catalan bijection gmA074685! acting on the parenthesizations encoded by A014486/A063171.A074685
Permutation of natural numbers induced by the Catalan bijection gmA074685! acting on the parenthesizations encoded by A014486/A063171.
- Permutation of natural numbers induced by the Catalan bijection gmA074686! acting on the parenthesizations encoded by A014486/A063171.A074686
Permutation of natural numbers induced by the Catalan bijection gmA074686! acting on the parenthesizations encoded by A014486/A063171.
- Permutation of natural numbers induced by the Catalan bijection gmA074687! acting on the parenthesizations encoded by A014486/A063171.A074687
Permutation of natural numbers induced by the Catalan bijection gmA074687! acting on the parenthesizations encoded by A014486/A063171.
- Permutation of natural numbers induced by the Catalan bijection gmA074688! acting on the parenthesizations encoded by A014486/A063171.A074688
Permutation of natural numbers induced by the Catalan bijection gmA074688! acting on the parenthesizations encoded by A014486/A063171.
- Permutation of natural numbers induced by the Catalan bijection gmA074689! acting on the parenthesizations encoded by A014486/A063171.A074689
Permutation of natural numbers induced by the Catalan bijection gmA074689! acting on the parenthesizations encoded by A014486/A063171.
- Permutation of natural numbers induced by the Catalan bijection gmA074690! acting on the parenthesizations encoded by A014486/A063171.A074690
Permutation of natural numbers induced by the Catalan bijection gmA074690! acting on the parenthesizations encoded by A014486/A063171.
- Squarefree Fibonacci numbers with odd number of prime factors.A074691
Squarefree Fibonacci numbers with odd number of prime factors.
- 1 + n-th prime is harmonic.A074692
1 + n-th prime is harmonic.
- a(1) = 1, a(n) = a(n-1) + phi(a(n-1)).A074693
a(1) = 1, a(n) = a(n-1) + phi(a(n-1)).
- Decimal expansion of the solution x of phi^x = lim_{n -> infinity} (1/n)*Sum_{k=1..n} (Fibonacci(k+1)/Fibonacci(k))^x where phi is the golden ratio = (1 + sqrt(5))/2.A074694
Decimal expansion of the solution x of phi^x = lim_{n -> infinity} (1/n)*Sum_{k=1..n} (Fibonacci(k+1)/Fibonacci(k))^x where phi is the golden ratio = (1 + sqrt(5))/2.
- Greatest common divisor of n and floor(n^(1/2))^2.A074695
Greatest common divisor of n and floor(n^(1/2))^2.
- Numbers k such that 2^k+1 has more than k divisors (k such that A000005(2^k+1) > k).A074696
Numbers k such that 2^k+1 has more than k divisors (k such that A000005(2^k+1) > k).
- Fibonacci(k) has more than k divisors (k such that A000005(A000045(k)) > k).A074697
Fibonacci(k) has more than k divisors (k such that A000005(A000045(k)) > k).
- Numbers k that divide the number of divisors of Fibonacci(k).A074698
Numbers k that divide the number of divisors of Fibonacci(k).
- a(n) = tau(Fibonacci(24*2^n))/(24*2^n) where tau(x) is the number of divisors of x (A000005(x)).A074699
a(n) = tau(Fibonacci(24*2^n))/(24*2^n) where tau(x) is the number of divisors of x (A000005(x)).
- a(n) = tau(F(2^n)) where tau(x) is the number of divisors of x (A000005(x)) and F(k) the k-th Fibonacci number (A000045(k)).A074700
a(n) = tau(F(2^n)) where tau(x) is the number of divisors of x (A000005(x)) and F(k) the k-th Fibonacci number (A000045(k)).
- Numbers k such that k = Sum_{d|phi(k)} mu(phi(d))*phi(k)/d.A074701
Numbers k such that k = Sum_{d|phi(k)} mu(phi(d))*phi(k)/d.
- a(n) = ((n+1)^2*(n-1)*a(n-1)+(-1)^(n+1))/n.A074702
a(n) = ((n+1)^2*(n-1)*a(n-1)+(-1)^(n+1))/n.
- a(n) = n^2*a(n-1)+1, a(1)=0.A074703
a(n) = n^2*a(n-1)+1, a(1)=0.
- a(n) = floor(n^(3/2)) - n*floor(n^(1/2)).A074704
a(n) = floor(n^(3/2)) - n*floor(n^(1/2)).
- a(1)=4; for n>1: number of primes between squares of (n-1)-th and (n+1)-th primes.A074705
a(1)=4; for n>1: number of primes between squares of (n-1)-th and (n+1)-th primes.
- 1/(1+Sum_{n>0} (-x)^n/n^2) = Sum_{n>=0} a(n)*x^n/n!^2.A074706
1/(1+Sum_{n>0} (-x)^n/n^2) = Sum_{n>=0} a(n)*x^n/n!^2.
- exp(Sum_{n>0} x^n/n^2) = Sum_{n>=0} a(n)*x^n/n!^2.A074707
exp(Sum_{n>0} x^n/n^2) = Sum_{n>=0} a(n)*x^n/n!^2.
- -log(1-Sum_{n>0} x^n/n^2) = Sum_{n>=0} a(n)*x^n/n!^2.A074708
-log(1-Sum_{n>0} x^n/n^2) = Sum_{n>=0} a(n)*x^n/n!^2.
- Base 4 expansion of 1/n has equal percentage of each digit 0,1,2,3.A074709
Base 4 expansion of 1/n has equal percentage of each digit 0,1,2,3.
- Numbers k such that x^k + x^2 + 1 is a primitive irreducible polynomial over GF(2).A074710
Numbers k such that x^k + x^2 + 1 is a primitive irreducible polynomial over GF(2).