Sequences
392,541 sequences
- Factorial, or factoradic, expansion of log(11) = Sum_{n>=1} a(n)/n!, with a(n) as large as possible.A068461
Factorial, or factoradic, expansion of log(11) = Sum_{n>=1} a(n)/n!, with a(n) as large as possible.
- Factorial expansion of the cube root of 2: 2^(1/3) = Sum_{n>0} a(n)/n!.A068462
Factorial expansion of the cube root of 2: 2^(1/3) = Sum_{n>0} a(n)/n!.
- Factorial expansion of Gamma(3/4) = Sum_{n>=1} a(n)/n! where Gamma is Euler's gamma function.A068463
Factorial expansion of Gamma(3/4) = Sum_{n>=1} a(n)/n! where Gamma is Euler's gamma function.
- Factorial expansion of Gamma(1/4) = Sum_{n>=1} a(n)/n! with largest possible a(n), and Gamma = Euler's gamma function.A068464
Factorial expansion of Gamma(1/4) = Sum_{n>=1} a(n)/n! with largest possible a(n), and Gamma = Euler's gamma function.
- Decimal expansion of Gamma(3/4).A068465
Decimal expansion of Gamma(3/4).
- Decimal expansion of Gamma(1/4).A068466
Decimal expansion of Gamma(1/4).
- Decimal expansion of (1/4)! = Gamma(5/4).A068467
Decimal expansion of (1/4)! = Gamma(5/4).
- Decimal expansion of zeta(6)/(zeta(2)*zeta(3)).A068468
Decimal expansion of zeta(6)/(zeta(2)*zeta(3)).
- Decimal expansion of zeta(Pi).A068469
Decimal expansion of zeta(Pi).
- Decimal expansion of exp(sqrt(Pi)).A068470
Decimal expansion of exp(sqrt(Pi)).
- Number of n X n binary matrices with each 1 having at most 2 adjacent 1's.A068471
Number of n X n binary matrices with each 1 having at most 2 adjacent 1's.
- Number of n X n binary matrices with every 1 having at most 3 adjacent 1's.A068472
Number of n X n binary matrices with every 1 having at most 3 adjacent 1's.
- Numbers n such that phi((prime(n)+1)/2)=sigma(n).A068473
Numbers n such that phi((prime(n)+1)/2)=sigma(n).
- Numbers k such that phi((prime(k)-1)/2) = sigma(k).A068474
Numbers k such that phi((prime(k)-1)/2) = sigma(k).
- a(n) = Sum_{m=0..n} m*n^(m-1).A068475
a(n) = Sum_{m=0..n} m*n^(m-1).
- a(n) = Sum_{m=1..n} m*n^(m+(-1)^n).A068476
a(n) = Sum_{m=1..n} m*n^(m+(-1)^n).
- a(n) is the digital sum of 1^n + 2^n + ... + n^n.A068477
a(n) is the digital sum of 1^n + 2^n + ... + n^n.
- Engel expansion of Gamma(3/4) = Sum_{i>0} 1/Product_{n=1..i} 1/a(n).A068478
Engel expansion of Gamma(3/4) = Sum_{i>0} 1/Product_{n=1..i} 1/a(n).
- Engel expansion of Gamma(1/4)=3.62560990822190831193...A068479
Engel expansion of Gamma(1/4)=3.62560990822190831193...
- Numbers n such that gcd(n!-1,2^n+1)>1.A068480
Numbers n such that gcd(n!-1,2^n+1)>1.
- Numbers k such that gcd(k!+1, 2^k+1) > 1.A068481
Numbers k such that gcd(k!+1, 2^k+1) > 1.
- Numbers n such that gcd(n!+1,2^n-1)>1.A068482
Numbers n such that gcd(n!+1,2^n-1)>1.
- Numbers n such that gcd(n!-1,2^n-1)>1.A068483
Numbers n such that gcd(n!-1,2^n-1)>1.
- Numbers k that divide phi(k)^2 + sigma(k)^2.A068484
Numbers k that divide phi(k)^2 + sigma(k)^2.
- One-sixtieth of the even leg of Pythagorean triangles whose other sides are both primes (other than 3, 5 or 13).A068485
One-sixtieth of the even leg of Pythagorean triangles whose other sides are both primes (other than 3, 5 or 13).
- Smallest prime equal to n^2 + m^2 with n >= m.A068486
Smallest prime equal to n^2 + m^2 with n >= m.
- Smallest prime equal to n^2 + m^2 with n<m.A068487
Smallest prime equal to n^2 + m^2 with n<m.
- m for which p(m) is the least prime dividing #p(n) + 1, i.e., primorial n-th prime augmented by 1 (A005234).A068488
m for which p(m) is the least prime dividing #p(n) + 1, i.e., primorial n-th prime augmented by 1 (A005234).
- m for which prime(m) is the least prime dividing #prime(n) - 1, i.e., one less than primorial n-th prime (A057588).A068489
m for which prime(m) is the least prime dividing #prime(n) - 1, i.e., one less than primorial n-th prime (A057588).
- Fixed point of the morphism 1 -> 121, 2 -> 12, starting from 1.A068490
Fixed point of the morphism 1 -> 121, 2 -> 12, starting from 1.
- Expansion of Molien series for a certain 4-D group of order 96.A068491
Expansion of Molien series for a certain 4-D group of order 96.
- Primes that remain prime after each digit is replaced by its square.A068492
Primes that remain prime after each digit is replaced by its square.
- Primes which are concatenations of positive squares.A068493
Primes which are concatenations of positive squares.
- a(n) = n mod phi(n).A068494
a(n) = n mod phi(n).
- Composite n such that n reduced mod(phi(n)) = sigma(n) reduced mod(n).A068495
Composite n such that n reduced mod(phi(n)) = sigma(n) reduced mod(n).
- a(n) = n! reduced mod 2^n.A068496
a(n) = n! reduced mod 2^n.
- Primes p such that 2*p+1 and 2*p-1 are composites.A068497
Primes p such that 2*p+1 and 2*p-1 are composites.
- Fibonacci numbers whose sum of decimal digits is greater than its index.A068498
Fibonacci numbers whose sum of decimal digits is greater than its index.
- Numbers m such that m! reduced modulo (m+1) is not zero.A068499
Numbers m such that m! reduced modulo (m+1) is not zero.
- Sequence of Fibonacci numbers whose sum of decimal digits sets a new record.A068500
Sequence of Fibonacci numbers whose sum of decimal digits sets a new record.
- Values m such that the consecutive pair parameters(m,m+1) generate Pythagorean triples whose odd terms are both prime.A068501
Values m such that the consecutive pair parameters(m,m+1) generate Pythagorean triples whose odd terms are both prime.
- Composite numbers k such that gcd(sigma(k), k) = gcd(k, phi(k)).A068502
Composite numbers k such that gcd(sigma(k), k) = gcd(k, phi(k)).
- Highest power of 3 dividing prime(n)-1.A068503
Highest power of 3 dividing prime(n)-1.
- Highest power of 2 dividing prime(n)+1.A068504
Highest power of 2 dividing prime(n)+1.
- Decimal representation of n interpreted in base b+1, where b=A054055(n) is the largest digit in decimal representation of n.A068505
Decimal representation of n interpreted in base b+1, where b=A054055(n) is the largest digit in decimal representation of n.
- Least highly composite number whose prime decomposition starts with 2^n.A068506
Least highly composite number whose prime decomposition starts with 2^n.
- Highly composite numbers sandwiched between twin primes.A068507
Highly composite numbers sandwiched between twin primes.
- a(n) = round((a(n-1) + a(n-2))/a(n-3)) starting with a(1)=a(2)=a(3)=1.A068508
a(n) = round((a(n-1) + a(n-2))/a(n-3)) starting with a(1)=a(2)=a(3)=1.
- a(n) = maximum length of a subset in {1,..,n} whose integers have pairwise LCM not exceeding n.A068509
a(n) = maximum length of a subset in {1,..,n} whose integers have pairwise LCM not exceeding n.
- a(n) = lcm(1,...,n) - (product of primes <= n).A068510
a(n) = lcm(1,...,n) - (product of primes <= n).