Sequences
392,541 sequences
- Highest proper factor of n!+1.A056111
Highest proper factor of n!+1.
- a(1) = 1; a(m+1) = sum_{k=1 to m} [max(m, a(k))].A056112
a(1) = 1; a(m+1) = sum_{k=1 to m} [max(m, a(k))].
- Most significant digit of n-th primorial A002110.A056113
Most significant digit of n-th primorial A002110.
- Expansion of (1+9*x)/(1-x)^11.A056114
Expansion of (1+9*x)/(1-x)^11.
- a(n) = n*(n+11)/2.A056115
a(n) = n*(n+11)/2.
- a(n) = 121*12^(n-2), a(0)=1, a(1)=10.A056116
a(n) = 121*12^(n-2), a(0)=1, a(1)=10.
- Expansion of (1+8*x)/(1-x)^9.A056117
Expansion of (1+8*x)/(1-x)^9.
- a(n) = (11*n+5)*(n+4)*(n+3)*(n+2)*(n+1)/120.A056118
a(n) = (11*n+5)*(n+4)*(n+3)*(n+2)*(n+1)/120.
- a(n) = n*(n+13)/2.A056119
a(n) = n*(n+13)/2.
- a(n) = (3^3)*4^(n-3) with a(0)=1, a(1)=1 and a(2)=7.A056120
a(n) = (3^3)*4^(n-3) with a(0)=1, a(1)=1 and a(2)=7.
- a(n) = n*(n + 15)/2.A056121
a(n) = n*(n + 15)/2.
- a(n) = (8*n+9)*C(n+8,8)/9.A056122
a(n) = (8*n+9)*C(n+8,8)/9.
- a(n) = 3*a(n-1) - a(n-2) with a(0)=1, a(1)=11.A056123
a(n) = 3*a(n-1) - a(n-2) with a(0)=1, a(1)=11.
- a(n) = 3*a(n-1) - a(n-2) + 8 with a(0)=1, a(1)=11.A056124
a(n) = 3*a(n-1) - a(n-2) + 8 with a(0)=1, a(1)=11.
- a(n) = (5*n + 4)*binomial(n+7,7)/4.A056125
a(n) = (5*n + 4)*binomial(n+7,7)/4.
- a(n) = n*(n + 17)/2.A056126
a(n) = n*(n + 17)/2.
- Minimum m where product_{k=1 to m}[p_k] > (p_{m+1})^n, where p_k is k-th prime.A056127
Minimum m where product_{k=1 to m}[p_k] > (p_{m+1})^n, where p_k is k-th prime.
- a(n) = (9*n + 11)*binomial(n+10, 10)/11.A056128
a(n) = (9*n + 11)*binomial(n+10, 10)/11.
- Final nonzero digit of n-th primorial.A056129
Final nonzero digit of n-th primorial.
- Palindromic primes in bases 2 and 4.A056130
Palindromic primes in bases 2 and 4.
- Sequence A001033 gives the numbers n such that the sum of the squares of n consecutive odd numbers x^2 + (x+2)^2 + ... +(x+2n-2)^2 = k^2 for some integer k. For each n, this sequence gives the least value of x.A056131
Sequence A001033 gives the numbers n such that the sum of the squares of n consecutive odd numbers x^2 + (x+2)^2 + ... +(x+2n-2)^2 = k^2 for some integer k. For each n, this sequence gives the least value of x.
- Sequence A001033 gives the numbers n such that the sum of the squares of n consecutive odd numbers x^2 + (x+2)^2 + ... +(x+2n-2)^2 = k^2 for some integer k. For each n, this sequence gives the least value of k.A056132
Sequence A001033 gives the numbers n such that the sum of the squares of n consecutive odd numbers x^2 + (x+2)^2 + ... +(x+2n-2)^2 = k^2 for some integer k. For each n, this sequence gives the least value of k.
- a(1) = 1, a(m+1) = sum_{k=1 to m}[min(m, a(k))].A056133
a(1) = 1, a(m+1) = sum_{k=1 to m}[min(m, a(k))].
- Smallest positive integer which is the geometric mean of n and an integer other than n.A056134
Smallest positive integer which is the geometric mean of n and an integer other than n.
- Smallest positive integer other than n where geometric mean of n and a(n) is an integer.A056135
Smallest positive integer other than n where geometric mean of n and a(n) is an integer.
- Largest positive integer whose harmonic mean with another positive integer is n.A056136
Largest positive integer whose harmonic mean with another positive integer is n.
- Number of ways in which n can be the longer leg (middle side) of an integer-sided right triangle.A056137
Number of ways in which n can be the longer leg (middle side) of an integer-sided right triangle.
- Number of ways in which n can be the shorter leg (shortest side) of an integer-sided right triangle.A056138
Number of ways in which n can be the shorter leg (shortest side) of an integer-sided right triangle.
- a(n) = n^2 - primefloor(n)*primeceiling(n).A056139
a(n) = n^2 - primefloor(n)*primeceiling(n).
- a(n) = n^2 - previousprime(n)*nextprime(n), for n>2.A056140
a(n) = n^2 - previousprime(n)*nextprime(n), for n>2.
- a(n) = primefloor(n)*primeceiling(n) - previousprime(n)*nextprime(n).A056141
a(n) = primefloor(n)*primeceiling(n) - previousprime(n)*nextprime(n).
- Concatenate n, floor[n/10], floor[n/100] ... (but do not continue if floor[.]=0).A056142
Concatenate n, floor[n/10], floor[n/100] ... (but do not continue if floor[.]=0).
- Concatenate ... floor[n/100], floor[n/10], n.A056143
Concatenate ... floor[n/100], floor[n/10], n.
- a(1) = 1, a(m+1) = Sum_{k=1..m} gcd(m, a(k)).A056144
a(1) = 1, a(m+1) = Sum_{k=1..m} gcd(m, a(k)).
- Palindromic primes in bases 2 and 8.A056145
Palindromic primes in bases 2 and 8.
- Palindromic primes in bases 4 and 8.A056146
Palindromic primes in bases 4 and 8.
- a(1) = 1, a(m+1) = Sum_{k=1..m} lcm(m, a(k)).A056147
a(1) = 1, a(m+1) = Sum_{k=1..m} lcm(m, a(k)).
- a(0) = 1, a(n) = number of a(k), for 0 <= k <= n-1, that divide n.A056148
a(0) = 1, a(n) = number of a(k), for 0 <= k <= n-1, that divide n.
- a(0) = 1, a(m) = number of a(k), 0 <= k <= m-1, where gcd(m, a(k)) = 1.A056149
a(0) = 1, a(m) = number of a(k), 0 <= k <= m-1, where gcd(m, a(k)) = 1.
- Number of combinations for each possible sum when throwing 3 (normal) dice.A056150
Number of combinations for each possible sum when throwing 3 (normal) dice.
- Distribution of maximum inversion table entry.A056151
Distribution of maximum inversion table entry.
- Triangular array giving number of bipartite graphs with n vertices, no isolated vertices and a distinguished bipartite block with k=1..n-1 vertices, up to isomorphism.A056152
Triangular array giving number of bipartite graphs with n vertices, no isolated vertices and a distinguished bipartite block with k=1..n-1 vertices, up to isomorphism.
- Leading least prime signatures: a(n) is in A025487 but a(n)/2 is not.A056153
Leading least prime signatures: a(n) is in A025487 but a(n)/2 is not.
- Numbers n such that the number of times each digit occurs in 2^n, represented in base 3, is the same as 2^(n+1), also represented in base 3. Or in other words, when represented in base 3, the digits in 2^n can be rearranged to form 2^(n+1).A056154
Numbers n such that the number of times each digit occurs in 2^n, represented in base 3, is the same as 2^(n+1), also represented in base 3. Or in other words, when represented in base 3, the digits in 2^n can be rearranged to form 2^(n+1).
- Positive integer k, 1 <= k <= n, which maximizes k^(n+1-k).A056155
Positive integer k, 1 <= k <= n, which maximizes k^(n+1-k).
- Number of connected bipartite graphs with n edges, no isolated vertices and a distinguished bipartite block, up to isomorphism.A056156
Number of connected bipartite graphs with n edges, no isolated vertices and a distinguished bipartite block, up to isomorphism.
- Primes p whose period of reciprocal equals (p-1)/4.A056157
Primes p whose period of reciprocal equals (p-1)/4.
- Equivalent of the Kurepa hypothesis for left factorial.A056158
Equivalent of the Kurepa hypothesis for left factorial.
- a(n) = floor(10^(n-1)/n).A056159
a(n) = floor(10^(n-1)/n).
- Sum of A054988 and A054989.A056160
Sum of A054988 and A054989.