Sequences
392,541 sequences
- Odd number of 0's and 1's in binary expansion.A059011
Odd number of 0's and 1's in binary expansion.
- Numbers that have an even number of 0's and 1's in their binary expansion.A059012
Numbers that have an even number of 0's and 1's in their binary expansion.
- Odd number of 0's and even number of 1's in binary expansion.A059013
Odd number of 0's and even number of 1's in binary expansion.
- Numbers that have an even number of 0's and an odd number of 1's in binary expansion.A059014
Numbers that have an even number of 0's and an odd number of 1's in binary expansion.
- Total number of 0's in binary expansions of 0, ..., n.A059015
Total number of 0's in binary expansions of 0, ..., n.
- Number of 0's in binary expansion of Fibonacci(n).A059016
Number of 0's in binary expansion of Fibonacci(n).
- Smallest n-digit prime whose square is a concatenation of two n-digit primes (no leading zeros allowed), 0 if no such prime.A059017
Smallest n-digit prime whose square is a concatenation of two n-digit primes (no leading zeros allowed), 0 if no such prime.
- Write 10*n in base 4; a(n) = sum of digits mod 4.A059018
Write 10*n in base 4; a(n) = sum of digits mod 4.
- Number of Dyck paths of semilength n with no peak at height 3.A059019
Number of Dyck paths of semilength n with no peak at height 3.
- Number of 2 X n checkerboards (with at least one red square) in which the set of red squares is edge connected.A059020
Number of 2 X n checkerboards (with at least one red square) in which the set of red squares is edge connected.
- Number of 3 X n checkerboards (with at least one red square) in which the set of red squares is edge-connected.A059021
Number of 3 X n checkerboards (with at least one red square) in which the set of red squares is edge-connected.
- Triangle of Stirling numbers of order 3.A059022
Triangle of Stirling numbers of order 3.
- Triangle of Stirling numbers of order 4.A059023
Triangle of Stirling numbers of order 4.
- Triangle of Stirling numbers of order 5.A059024
Triangle of Stirling numbers of order 5.
- Triangle of Stirling numbers of order 6.A059025
Triangle of Stirling numbers of order 6.
- Table B(n,m) read by rows: B(n,m) = LCM(n,m)/n + LCM(n,m)/m - 1 for all 1<=m<=n.A059026
Table B(n,m) read by rows: B(n,m) = LCM(n,m)/n + LCM(n,m)/m - 1 for all 1<=m<=n.
- Number of Dyck paths of semilength n with no peak at height 4.A059027
Number of Dyck paths of semilength n with no peak at height 4.
- Row sums of A059026: a(n) = Sum_{m=1..n} (lcm(n,m)/n + lcm(n,m)/m - 1).A059028
Row sums of A059026: a(n) = Sum_{m=1..n} (lcm(n,m)/n + lcm(n,m)/m - 1).
- a(n) = n if n is even, 2*n + 1 if n is odd.A059029
a(n) = n if n is even, 2*n + 1 if n is odd.
- Fourth main diagonal of A059026: a(n) = B(n+3,n) = lcm(n+3,n)/(n+3) + lcm(n+3,n)/n - 1 for all n >= 1.A059030
Fourth main diagonal of A059026: a(n) = B(n+3,n) = lcm(n+3,n)/(n+3) + lcm(n+3,n)/n - 1 for all n >= 1.
- Fifth main diagonal of A059026: a(n) = B(n+4,n) = lcm(n+4,n)/(n+4) + lcm(n+4,n)/n - 1 for all n >= 1.A059031
Fifth main diagonal of A059026: a(n) = B(n+4,n) = lcm(n+4,n)/(n+4) + lcm(n+4,n)/n - 1 for all n >= 1.
- Another variant of Boustrophedon transform applied to 1, 0, 0, 0, ...A059032
Another variant of Boustrophedon transform applied to 1, 0, 0, 0, ...
- Triangle in A059032 read by rows from left to right.A059033
Triangle in A059032 read by rows from left to right.
- Triangle in A059032 read by rows in natural order.A059034
Triangle in A059032 read by rows in natural order.
- Row sums of A059032.A059035
Row sums of A059032.
- In a triangle of numbers (such as that in A059032, A059033, A059034) how many entries lie above position (n,k)? Answer: T(n,k) = (n+1)*(k+1)-1 (n >= 0, k >= 0).A059036
In a triangle of numbers (such as that in A059032, A059033, A059034) how many entries lie above position (n,k)? Answer: T(n,k) = (n+1)*(k+1)-1 (n >= 0, k >= 0).
- The transformation of A059032 applied to 1, 1, 1, 1, ...A059037
The transformation of A059032 applied to 1, 1, 1, 1, ...
- Triangle in A059037 read by rows from left to right.A059038
Triangle in A059037 read by rows from left to right.
- Triangle in A059037 read by rows in natural order.A059039
Triangle in A059037 read by rows in natural order.
- Row sums of triangle A059037.A059040
Row sums of triangle A059037.
- Numbers k such that 3*7^k + 2 is prime.A059041
Numbers k such that 3*7^k + 2 is prime.
- Numbers k such that 2*7^k + 5 is prime.A059042
Numbers k such that 2*7^k + 5 is prime.
- Numbers in which each digit is the (immediate) successor of the previous one (if it exists) and 0 is considered the successor of 9.A059043
Numbers in which each digit is the (immediate) successor of the previous one (if it exists) and 0 is considered the successor of 9.
- Initial primes of sets of 5 consecutive primes in arithmetic progression.A059044
Initial primes of sets of 5 consecutive primes in arithmetic progression.
- Square array T(n,k) read by antidiagonals where T(0,k) = 0 and T(n,k) = 1 + 2k + 3k^2 + ... + n*k^(n-1).A059045
Square array T(n,k) read by antidiagonals where T(0,k) = 0 and T(n,k) = 1 + 2k + 3k^2 + ... + n*k^(n-1).
- Numbers n such that sigma(n)-n divides n-1.A059046
Numbers n such that sigma(n)-n divides n-1.
- Numbers x such that sigma(x)-x divides x-1, other than prime powers.A059047
Numbers x such that sigma(x)-x divides x-1, other than prime powers.
- Triangle A(n,m) of numbers of n-element ordered T_0-antichains on an unlabeled m-set or numbers of T_1-hypergraphs on n labeled nodes with m (not necessarily empty) distinct hyperedges (m=0,1,...,2^n).A059048
Triangle A(n,m) of numbers of n-element ordered T_0-antichains on an unlabeled m-set or numbers of T_1-hypergraphs on n labeled nodes with m (not necessarily empty) distinct hyperedges (m=0,1,...,2^n).
- Number of 6-element ordered T_0-antichains on an unlabeled n-set; T_1-hypergraphs on 6 labeled nodes with n (not necessarily empty) distinct hyperedges (n=0,1,...,64).A059049
Number of 6-element ordered T_0-antichains on an unlabeled n-set; T_1-hypergraphs on 6 labeled nodes with n (not necessarily empty) distinct hyperedges (n=0,1,...,64).
- Number of 7-element ordered T_0-antichains on an unlabeled n-set; T_1-hypergraphs on 7 labeled nodes with n (not necessarily empty) distinct hyperedges (n=0,1,...,128).A059050
Number of 7-element ordered T_0-antichains on an unlabeled n-set; T_1-hypergraphs on 7 labeled nodes with n (not necessarily empty) distinct hyperedges (n=0,1,...,128).
- Number of ordered T_0-antichains on an unlabeled n-set; labeled T_1-hypergraphs with n (not necessarily empty) distinct hyperedges.A059051
Number of ordered T_0-antichains on an unlabeled n-set; labeled T_1-hypergraphs with n (not necessarily empty) distinct hyperedges.
- Number of n-element unlabeled ordered T_0-antichains; T_1-hypergraphs (with empty hyperedge but without multiple hyperedges) on n labeled nodes.A059052
Number of n-element unlabeled ordered T_0-antichains; T_1-hypergraphs (with empty hyperedge but without multiple hyperedges) on n labeled nodes.
- Number of chiral pairs of necklaces with n beads and two colors (color complements being equivalent); i.e., turning the necklace over neither leaves it unchanged nor simply swaps the colors.A059053
Number of chiral pairs of necklaces with n beads and two colors (color complements being equivalent); i.e., turning the necklace over neither leaves it unchanged nor simply swaps the colors.
- Integers which can be written as (b^k+1)/(b+1) for positive integers b and k.A059054
Integers which can be written as (b^k+1)/(b+1) for positive integers b and k.
- Primes which can be written as (b^k+1)/(b+1) for positive integers b and k.A059055
Primes which can be written as (b^k+1)/(b+1) for positive integers b and k.
- Penrice Christmas gift numbers, Card-matching numbers (Dinner-Diner matching numbers): Triangle T(n,k) = number of ways to get k matches for a deck with n cards, 2 of each kind.A059056
Penrice Christmas gift numbers, Card-matching numbers (Dinner-Diner matching numbers): Triangle T(n,k) = number of ways to get k matches for a deck with n cards, 2 of each kind.
- Penrice Christmas gift numbers, Card-matching numbers (Dinner-Diner matching numbers).A059057
Penrice Christmas gift numbers, Card-matching numbers (Dinner-Diner matching numbers).
- Card-matching numbers (Dinner-Diner matching numbers).A059058
Card-matching numbers (Dinner-Diner matching numbers).
- Card-matching numbers (Dinner-Diner matching numbers).A059059
Card-matching numbers (Dinner-Diner matching numbers).
- Card-matching numbers (Dinner-Diner matching numbers).A059060
Card-matching numbers (Dinner-Diner matching numbers).