Sequences
392,541 sequences
- Decimal expansion of Lehmer's constant (also known as the Salem constant).A073011
Decimal expansion of Lehmer's constant (also known as the Salem constant).
- Decimal expansion of Robbins constant.A073012
Decimal expansion of Robbins constant.
- a(n) = (1/2) * Sum_{k=1..n} (n+k)!/(k!)^2.A073013
a(n) = (1/2) * Sum_{k=1..n} (n+k)!/(k!)^2.
- a(n) = (n!/2)*Sum_{k=1..n} (n+k)!/(k!)^3.A073014
a(n) = (n!/2)*Sum_{k=1..n} (n+k)!/(k!)^3.
- a(n) is such that 2 = sqrt(1+sqrt(1+sqrt(1+....sqrt(a(n))....))) where there are n sqrt's.A073015
a(n) is such that 2 = sqrt(1+sqrt(1+sqrt(1+....sqrt(a(n))....))) where there are n sqrt's.
- Decimal expansion of Sum_{n>=1} 1/binomial(2n,n).A073016
Decimal expansion of Sum_{n>=1} 1/binomial(2n,n).
- Decimal expansion of the Product_{n>=1} (1 + 1/n^3).A073017
Decimal expansion of the Product_{n>=1} (1 + 1/n^3).
- Decimal expansion of gamma^exp(1).A073018
Decimal expansion of gamma^exp(1).
- Numbers n such that the absolute value of the real part of (1+2*I)^n is prime.A073019
Numbers n such that the absolute value of the real part of (1+2*I)^n is prime.
- Triangle of T(n,m) = number of bracelets (necklaces than can be turned over) with m white beads and (2n-m) black ones, for 1<=m<=n.A073020
Triangle of T(n,m) = number of bracelets (necklaces than can be turned over) with m white beads and (2n-m) black ones, for 1<=m<=n.
- Apart from initial 0, same as A055498.A073021
Apart from initial 0, same as A055498.
- Each term is the smallest prime > the sum of the previous 2 terms.A073022
Each term is the smallest prime > the sum of the previous 2 terms.
- Number of solutions to the equation n^x==1 (mod x), 1<=x<=n.A073023
Number of solutions to the equation n^x==1 (mod x), 1<=x<=n.
- Primes p such that p-1 has a prime factor q > p^(2/3).A073024
Primes p such that p-1 has a prime factor q > p^(2/3).
- Primes p such that p-1 has a prime factor q > p^(3/4).A073025
Primes p such that p-1 has a prime factor q > p^(3/4).
- Primes p such that p-1 has a prime factor q with (p-1)/2 > q > p^(3/4).A073026
Primes p such that p-1 has a prime factor q with (p-1)/2 > q > p^(3/4).
- Square array of decimal expansions of sqrt(n) (n>=1) read by antidiagonals.A073027
Square array of decimal expansions of sqrt(n) (n>=1) read by antidiagonals.
- a(n) = max{ C(n,0), C(n-1,1), C(n-2,2), ..., C(n-n,n) }.A073028
a(n) = max{ C(n,0), C(n-1,1), C(n-2,2), ..., C(n-n,n) }.
- Names for numbers in American English, with each letter transformed into its index in the alphabet.A073029
Names for numbers in American English, with each letter transformed into its index in the alphabet.
- Sum_{k=1..n, gcd(n,k) = 1} 10^(k-1).A073030
Sum_{k=1..n, gcd(n,k) = 1} 10^(k-1).
- Number of ways of making change for n cents using coins of sizes 1, 2, 5, 10 cents, when order matters.A073031
Number of ways of making change for n cents using coins of sizes 1, 2, 5, 10 cents, when order matters.
- A 4-cycle of the k => sigma(k)-k process, where sigma(k) is the sum of divisors of k (A000203).A073032
A 4-cycle of the k => sigma(k)-k process, where sigma(k) is the sum of divisors of k (A000203).
- A 4-cycle of the k => sigma(k)-k process, where sigma(k) is the sum of divisors of k (A000203).A073033
A 4-cycle of the k => sigma(k)-k process, where sigma(k) is the sum of divisors of k (A000203).
- Take A000040, omit commas: 23571113171923..., select 1-digit primes.A073034
Take A000040, omit commas: 23571113171923..., select 1-digit primes.
- Take A000040, omit commas: 23571113171923..., select 2-digit primes seen when scanning from left.A073035
Take A000040, omit commas: 23571113171923..., select 2-digit primes seen when scanning from left.
- Take A000040, omit commas: 23571113171923..., select primes seen when scanning three consecutive digits from left.A073036
Take A000040, omit commas: 23571113171923..., select primes seen when scanning three consecutive digits from left.
- Take A000040, omit commas: 23571113171923..., select 4-digit primes seen when scanning from left.A073037
Take A000040, omit commas: 23571113171923..., select 4-digit primes seen when scanning from left.
- Take A000040, omit commas: 23571113171923..., select 5-digit primes seen when scanning from left.A073038
Take A000040, omit commas: 23571113171923..., select 5-digit primes seen when scanning from left.
- First multiple of n in A025487.A073039
First multiple of n in A025487.
- Numbers n such that sum of proper divisors of n is a square.A073040
Numbers n such that sum of proper divisors of n is a square.
- n*R(n)-1 is prime, where R(n) is reverse of n.A073041
n*R(n)-1 is prime, where R(n) is reverse of n.
- Numbers of the form 10^s*t^2 or 10^s*t^3, s,t >= 0.A073042
Numbers of the form 10^s*t^2 or 10^s*t^3, s,t >= 0.
- Number of nonisomorphic (finite) groups with n conjugacy classes.A073043
Number of nonisomorphic (finite) groups with n conjugacy classes.
- Triangle read by rows: T(n,k) (n >= 1, n-1 >= k >= 0) = number of n-sequences of 0's and 1's with no pair of adjacent 0's and exactly k pairs of adjacent 1's.A073044
Triangle read by rows: T(n,k) (n >= 1, n-1 >= k >= 0) = number of n-sequences of 0's and 1's with no pair of adjacent 0's and exactly k pairs of adjacent 1's.
- Nonprime solutions to sopfr(n) = S(n), where sopfr(n) = A001414 and S(n) = A002034.A073045
Nonprime solutions to sopfr(n) = S(n), where sopfr(n) = A001414 and S(n) = A002034.
- Write 2*n = p + q (p, q prime), p*q minimal; then a(n) = p*q.A073046
Write 2*n = p + q (p, q prime), p*q minimal; then a(n) = p*q.
- Least k such that x(k)=0 where x(1)=n and x(k)=k*floor(x(k-1)/k).A073047
Least k such that x(k)=0 where x(1)=n and x(k)=k*floor(x(k-1)/k).
- Starting term of the first length-n chain of equidigital numbers (A046758).A073048
Starting term of the first length-n chain of equidigital numbers (A046758).
- Least m > 1 such that m^n has m divisors, or 0 if no such m exists.A073049
Least m > 1 such that m^n has m divisors, or 0 if no such m exists.
- a(n) = prime(2^n + 2) - prime(2^n + 1) - 1.A073050
a(n) = prime(2^n + 2) - prime(2^n + 1) - 1.
- Least k such that Sum_{i=1..k} (prime(i) + prime(i+2) - 2*prime(i+1)) = 2n + 1.A073051
Least k such that Sum_{i=1..k} (prime(i) + prime(i+2) - 2*prime(i+1)) = 2n + 1.
- Decimal expansion of cos(Pi/7).A073052
Decimal expansion of cos(Pi/7).
- Apply DENEAT operator (or the Sisyphus function) to n.A073053
Apply DENEAT operator (or the Sisyphus function) to n.
- Number of applications of DENEAT operator x -> A073053(x) needed to transform n to 123.A073054
Number of applications of DENEAT operator x -> A073053(x) needed to transform n to 123.
- a(n) = product of first n digits in the decimal expansion of Pi, ignoring decimal point.A073055
a(n) = product of first n digits in the decimal expansion of Pi, ignoring decimal point.
- Prime(n)-th digit after decimal point in decimal expansion of Pi.A073056
Prime(n)-th digit after decimal point in decimal expansion of Pi.
- Start with the word 1234, repeatedly append the words obtained via the maps 1 -> 12, 2 -> 13, 3 -> 42, 4 -> 43.A073057
Start with the word 1234, repeatedly append the words obtained via the maps 1 -> 12, 2 -> 13, 3 -> 42, 4 -> 43.
- Define s(1)={1,2}, s(2)={1,3} and s(3)={1}. For a finite sequence A={a_1, ..., a_n}, with elements in {1,2,3}, define t(A) to be the concatenation of A, s(a_1), s(a_2), ... and s(a_n). Start with the sequence {1,2,3} and repeatedly apply t; limiting sequence is shown.A073058
Define s(1)={1,2}, s(2)={1,3} and s(3)={1}. For a finite sequence A={a_1, ..., a_n}, with elements in {1,2,3}, define t(A) to be the concatenation of A, s(a_1), s(a_2), ... and s(a_n). Start with the sequence {1,2,3} and repeatedly apply t; limiting sequence is shown.
- a(n) = (1/2)*(A073504(n+1) - A073504(n)).A073059
a(n) = (1/2)*(A073504(n+1) - A073504(n)).
- Multiplication table for 1 and odd primes, read by antidiagonals.A073060
Multiplication table for 1 and odd primes, read by antidiagonals.