Sequences
392,541 sequences
- a(0) = 0; a(n) is obtained by incrementing each digit of a(n-1) by 1.A061511
a(0) = 0; a(n) is obtained by incrementing each digit of a(n-1) by 1.
- a(0) = 1; a(n) is obtained by incrementing each digit of a(n-1) by 2.A061512
a(0) = 1; a(n) is obtained by incrementing each digit of a(n-1) by 2.
- a(0) = 0; a(n) is obtained by incrementing each digit of a(n-1) by 2.A061513
a(0) = 0; a(n) is obtained by incrementing each digit of a(n-1) by 2.
- a(0) = 0; a(n) is obtained by incrementing each digit of a(n-1) by 3.A061514
a(0) = 0; a(n) is obtained by incrementing each digit of a(n-1) by 3.
- a(0) = 1; a(n) is obtained by incrementing each digit of a(n-1) by 3.A061515
a(0) = 1; a(n) is obtained by incrementing each digit of a(n-1) by 3.
- a(0) = 1; a(n) is obtained by incrementing each digit of a(n-1) by 4.A061516
a(0) = 1; a(n) is obtained by incrementing each digit of a(n-1) by 4.
- a(0) = 0; a(n) is obtained by incrementing each digit of a(n-1) by 4.A061517
a(0) = 0; a(n) is obtained by incrementing each digit of a(n-1) by 4.
- a(0) = 0; a(n) is obtained by incrementing each digit of a(n-1) by 5.A061518
a(0) = 0; a(n) is obtained by incrementing each digit of a(n-1) by 5.
- a(0) = 1; a(n) is obtained by incrementing each digit of a(n-1) by 5.A061519
a(0) = 1; a(n) is obtained by incrementing each digit of a(n-1) by 5.
- a(0) = 0; a(n) is obtained by incrementing each digit of a(n-1) by 6.A061520
a(0) = 0; a(n) is obtained by incrementing each digit of a(n-1) by 6.
- a(0) = 1; a(n) is obtained by incrementing each digit of a(n-1) by 6.A061521
a(0) = 1; a(n) is obtained by incrementing each digit of a(n-1) by 6.
- a(0) = 0; a(n) is obtained by incrementing each digit of a(n-1) by 7.A061522
a(0) = 0; a(n) is obtained by incrementing each digit of a(n-1) by 7.
- Integer part of the blowup factor for A025587(n).A061523
Integer part of the blowup factor for A025587(n).
- Surround numbers of an n X 2 rectangle when n is even.A061524
Surround numbers of an n X 2 rectangle when n is even.
- Surround numbers of an n X 2 rectangle when n is odd.A061525
Surround numbers of an n X 2 rectangle when n is odd.
- Number of complete games of n X n tic-tac-toe.A061526
Number of complete games of n X n tic-tac-toe.
- Number of complete games of n X n tic-tac-toe won by X.A061527
Number of complete games of n X n tic-tac-toe won by X.
- Number of complete games of n X n tic-tac-toe won by O.A061528
Number of complete games of n X n tic-tac-toe won by O.
- Number of complete games of n X n tic-tac-toe ending in a draw.A061529
Number of complete games of n X n tic-tac-toe ending in a draw.
- Number of complete "rational" games of n X n tic-tac-toe: for n > 2 these are games that are a theoretical draw after each move.A061530
Number of complete "rational" games of n X n tic-tac-toe: for n > 2 these are games that are a theoretical draw after each move.
- Boustrophedon transform of b(0)=1 and otherwise b(n)=mu(n).A061531
Boustrophedon transform of b(0)=1 and otherwise b(n)=mu(n).
- Nearest integer to n^7/49.A061532
Nearest integer to n^7/49.
- Limiting sequence of digits in A061584, starting with least significant digit.A061533
Limiting sequence of digits in A061584, starting with least significant digit.
- Expansion of (1-x^2)/(1-3*x-x^2+x^3).A061534
Expansion of (1-x^2)/(1-3*x-x^2+x^3).
- a(n) = a(n-1) + the number of primes <= a(n-1).A061535
a(n) = a(n-1) + the number of primes <= a(n-1).
- a(1) = 1 and a(n) = a(n-1) + (the number of primes <= n) for n > 1.A061536
a(1) = 1 and a(n) = a(n-1) + (the number of primes <= n) for n > 1.
- Product of unitary divisors of n.A061537
Product of unitary divisors of n.
- Product of all divisors of n, divided by product of unitary divisors; or equivalently product of non-unitary divisors of n.A061538
Product of all divisors of n, divided by product of unitary divisors; or equivalently product of non-unitary divisors of n.
- Number of signed permutations in B_n which correspond to smooth Schubert varieties. These permutations avoid the following patterns: (-2 -1) (1 2 -3) (1 -2 -3) (-1 2 -3) (2 -1 -3) (-2 1 -3) (3 -2 1) (2 -4 3 1) (-2 -4 3 1) (3412) (3 4 -1 2) (-3 4 1 2) (4 1 3 -2) (4 -1 3 -2) (4 2 3 1) (4 2 3 -1) (-4 2 3 1).A061539
Number of signed permutations in B_n which correspond to smooth Schubert varieties. These permutations avoid the following patterns: (-2 -1) (1 2 -3) (1 -2 -3) (-1 2 -3) (2 -1 -3) (-2 1 -3) (3 -2 1) (2 -4 3 1) (-2 -4 3 1) (3412) (3 4 -1 2) (-3 4 1 2) (4 1 3 -2) (4 -1 3 -2) (4 2 3 1) (4 2 3 -1) (-4 2 3 1).
- Number of connected labeled graphs with n nodes and n+1 edges.A061540
Number of connected labeled graphs with n nodes and n+1 edges.
- Number of connected labeled graphs with n nodes and n+2 edges.A061541
Number of connected labeled graphs with n nodes and n+2 edges.
- Number of connected labeled graphs with n nodes and n+3 edges.A061542
Number of connected labeled graphs with n nodes and n+3 edges.
- Number of connected labeled graphs with n nodes and n+4 edges.A061543
Number of connected labeled graphs with n nodes and n+4 edges.
- Number of connected labeled graphs with n nodes and n+6 edges.A061544
Number of connected labeled graphs with n nodes and n+6 edges.
- Number of pair-exchange / set-rotate sequences achieving the minimum length of A048200(n).A061545
Number of pair-exchange / set-rotate sequences achieving the minimum length of A048200(n).
- Harmonic mean of digits is 7.A061546
Harmonic mean of digits is 7.
- Number of 132 and 213-avoiding derangements of {1,2,...,n}.A061547
Number of 132 and 213-avoiding derangements of {1,2,...,n}.
- Numerator of probability that there is no error when average of n numbers is computed, assuming errors of +1, -1 are possible and they each occur with p = 1/4.A061548
Numerator of probability that there is no error when average of n numbers is computed, assuming errors of +1, -1 are possible and they each occur with p = 1/4.
- Denominator of probability that there is no error when average of n numbers is computed, assuming errors of +1, -1 are possible and they each occur with p=1/4.A061549
Denominator of probability that there is no error when average of n numbers is computed, assuming errors of +1, -1 are possible and they each occur with p=1/4.
- a(n) = (2*n+1)*(2*n+3)*(2*n+5).A061550
a(n) = (2*n+1)*(2*n+3)*(2*n+5).
- Number of paths along a corridor width 8, starting from one side.A061551
Number of paths along a corridor width 8, starting from one side.
- Number of 1324-avoiding permutations of length n.A061552
Number of 1324-avoiding permutations of length n.
- Sum of absolute values of coefficients of expansion of (1-x)(1-x^2)(1-x^3)...(1-x^n).A061553
Sum of absolute values of coefficients of expansion of (1-x)(1-x^2)(1-x^3)...(1-x^n).
- Square table read by antidiagonals: a(n,k) = binomial(n+k, floor(k/2)).A061554
Square table read by antidiagonals: a(n,k) = binomial(n+k, floor(k/2)).
- Integer part of sigma(n!)/n!.A061555
Integer part of sigma(n!)/n!.
- a(n) is the least k > 0 such that sigma(k!) >= n*k!.A061556
a(n) is the least k > 0 such that sigma(k!) >= n*k!.
- a(n) = (7*n+2)*C(n)/(n+2), where C(n) is the n-th Catalan number.A061557
a(n) = (7*n+2)*C(n)/(n+2), where C(n) is the n-th Catalan number.
- The smallest difference of an increasing arithmetic progression of n primes with the minimal possible first term (A007918(n)).A061558
The smallest difference of an increasing arithmetic progression of n primes with the minimal possible first term (A007918(n)).
- Array read by antidiagonals: T(k,d) = number of different hyperplanes in d-space with integer coefficients in set {-k,...,-1,0,1,...,k}.A061559
Array read by antidiagonals: T(k,d) = number of different hyperplanes in d-space with integer coefficients in set {-k,...,-1,0,1,...,k}.
- Lengths of Farey-series (A005728) which are not primes.A061560
Lengths of Farey-series (A005728) which are not primes.