Sequences
392,541 sequences
- Smallest base in which n is a repdigit.A059711
Smallest base in which n is a repdigit.
- Number of stacked directed animals on the square lattice.A059712
Number of stacked directed animals on the square lattice.
- Number of multi-directed animals on the square lattice.A059713
Number of multi-directed animals on the square lattice.
- Number of stacked directed animals on the triangular lattice.A059714
Number of stacked directed animals on the triangular lattice.
- Number of multi-directed animals on the triangular lattice.A059715
Number of multi-directed animals on the triangular lattice.
- Number of column convex polyominoes with n hexagonal cells.A059716
Number of column convex polyominoes with n hexagonal cells.
- Start with decimal expansion of n; if all digits have the same parity, stop; otherwise write down the number formed by the even digits and the number formed by the odd digits and add them; repeat.A059717
Start with decimal expansion of n; if all digits have the same parity, stop; otherwise write down the number formed by the even digits and the number formed by the odd digits and add them; repeat.
- Triangle T(n,k), 0<=k<=n, giving coefficients when output sequence O_0, O_1, O_2, ... from transformation described in A059216 is expressed in terms of input sequence I_0, I_1, I_2, ...A059718
Triangle T(n,k), 0<=k<=n, giving coefficients when output sequence O_0, O_1, O_2, ... from transformation described in A059216 is expressed in terms of input sequence I_0, I_1, I_2, ...
- a(1)=2, a(n) is a k(n)-almost prime; m is an A-almost prime (for 1 < A); a(n) = smallest number m>a(n-1) such that m-a(i) is a (A-k(i))-almost prime for i = 1,..,n-1.A059719
a(1)=2, a(n) is a k(n)-almost prime; m is an A-almost prime (for 1 < A); a(n) = smallest number m>a(n-1) such that m-a(i) is a (A-k(i))-almost prime for i = 1,..,n-1.
- Triangle T(n,k), 0<=k<=n, formed from coefficients when formula for n-th diagonal of triangle in A059718 is written as a sum of binomial coefficients.A059720
Triangle T(n,k), 0<=k<=n, formed from coefficients when formula for n-th diagonal of triangle in A059718 is written as a sum of binomial coefficients.
- Mean of first six positive powers of n, i.e., (n + n^2 + n^3 + n^4 + n^5 + n^6)/6.A059721
Mean of first six positive powers of n, i.e., (n + n^2 + n^3 + n^4 + n^5 + n^6)/6.
- a(n) = n*(2*n^2 - 2*n + 1).A059722
a(n) = n*(2*n^2 - 2*n + 1).
- Mean of the first 2^n nonnegative powers of 3, i.e., (1 + 3 + 3^2 + ... + 3^(2^n-1))/2^n.A059723
Mean of the first 2^n nonnegative powers of 3, i.e., (1 + 3 + 3^2 + ... + 3^(2^n-1))/2^n.
- Second diagonal of A059720.A059724
Second diagonal of A059720.
- Central column in A059720.A059725
Central column in A059720.
- Row sums of A059720.A059726
Row sums of A059720.
- a(n) = Fibonacci(n)*(Fibonacci(n) + 1).A059727
a(n) = Fibonacci(n)*(Fibonacci(n) + 1).
- a(0)=3; thereafter, a(n) = A002426(n+1) + Fibonacci(n-1)*(Fibonacci(n-1) + 1).A059728
a(0)=3; thereafter, a(n) = A002426(n+1) + Fibonacci(n-1)*(Fibonacci(n-1) + 1).
- Carryless squares n X n base 10.A059729
Carryless squares n X n base 10.
- Third diagonal of A059922.A059730
Third diagonal of A059922.
- Row sums in A059922.A059731
Row sums in A059922.
- Central column (even terms a(2*n,n)) of A059922.A059732
Central column (even terms a(2*n,n)) of A059922.
- Central column a(n,[n/2]) of A059922.A059733
Central column a(n,[n/2]) of A059922.
- Carryless 11^n base 10; a(n) is carryless sum of 10*a(n-1) and a(n-1).A059734
Carryless 11^n base 10; a(n) is carryless sum of 10*a(n-1) and a(n-1).
- Number of complementary pairs of tournaments on n nodes.A059735
Number of complementary pairs of tournaments on n nodes.
- A class of polytopal spheres.A059736
A class of polytopal spheres.
- Lesser of the smallest pair of consecutive numbers divisible by an n-th power, but neither divisible by an (n+1)-st power.A059737
Lesser of the smallest pair of consecutive numbers divisible by an n-th power, but neither divisible by an (n+1)-st power.
- Binomial transform of A054341 and inverse binomial transform of A049027.A059738
Binomial transform of A054341 and inverse binomial transform of A049027.
- Triangle T(n,k), n >= 1, giving number of prime unoriented alternating links with n crossings and k components.A059739
Triangle T(n,k), n >= 1, giving number of prime unoriented alternating links with n crossings and k components.
- Erroneous version of A005160.A059740
Erroneous version of A005160.
- Prime unoriented alternating links with n crossings and 2 components.A059741
Prime unoriented alternating links with n crossings and 2 components.
- Decimal expansion of e + Pi.A059742
Decimal expansion of e + Pi.
- Number of points of norm^2 <= n^2 in the square lattice that are visible from the origin.A059743
Number of points of norm^2 <= n^2 in the square lattice that are visible from the origin.
- Numbers k such that k^2 is a palindromic square of sporadic type.A059744
Numbers k such that k^2 is a palindromic square of sporadic type.
- Palindromic squares of sporadic type.A059745
Palindromic squares of sporadic type.
- Numbers k such that 3*2^k + 7 is prime.A059746
Numbers k such that 3*2^k + 7 is prime.
- Numbers k such that 3*2^k - 7 is prime.A059747
Numbers k such that 3*2^k - 7 is prime.
- Numbers k such that 5*2^k + 7 is prime.A059748
Numbers k such that 5*2^k + 7 is prime.
- Numbers k such that 5*2^k - 7 is prime.A059749
Numbers k such that 5*2^k - 7 is prime.
- Decimal expansion of zeta(1/2) (negated).A059750
Decimal expansion of zeta(1/2) (negated).
- Grimm numbers (2): a(n) = largest k so that for each composite m in {n+1, n+2, ..., n+k} there corresponds a different divisor d_m with 1 < d_m < m.A059751
Grimm numbers (2): a(n) = largest k so that for each composite m in {n+1, n+2, ..., n+k} there corresponds a different divisor d_m with 1 < d_m < m.
- Record values in A059751.A059752
Record values in A059751.
- Minimal degree of a height one multiple of (x-1)^n.A059753
Minimal degree of a height one multiple of (x-1)^n.
- Smallest term in any sequence of n consecutive Smith numbers (A006753).A059754
Smallest term in any sequence of n consecutive Smith numbers (A006753).
- Odd rare numbers: odd n such that n-r and n+r are squares, where r is the reverse of n.A059755
Odd rare numbers: odd n such that n-r and n+r are squares, where r is the reverse of n.
- Erdős-Woods numbers: the length of an interval of consecutive integers with property that every element has a factor in common with one of the endpoints.A059756
Erdős-Woods numbers: the length of an interval of consecutive integers with property that every element has a factor in common with one of the endpoints.
- Initial terms of smallest Erdős-Woods intervals corresponding to the terms of A059756.A059757
Initial terms of smallest Erdős-Woods intervals corresponding to the terms of A059756.
- Undulating palindromic primes: numbers that are prime, palindromic in base 10, and the digits alternate: ababab... with a != b.A059758
Undulating palindromic primes: numbers that are prime, palindromic in base 10, and the digits alternate: ababab... with a != b.
- Numbers k such that 3*2^k + 35 is prime.A059759
Numbers k such that 3*2^k + 35 is prime.
- a(n) is the number of edges (one-dimensional faces) in the convex polytope of real n X n doubly stochastic matrices.A059760
a(n) is the number of edges (one-dimensional faces) in the convex polytope of real n X n doubly stochastic matrices.