A000595 Number of nonisomorphic unlabeled binary relations on n nodes.
A001948 These numbers when multiplied by all powers of 4 give the numbers [ up to 160000 ] that are not the sums of 4 distinct squares.
A002097 Numbers that are not the sum of 3 nonzero triangular numbers.
A002243 Numbers that are not the sum of 3 distinct triangular numbers.
A002244 Numbers that are not the sum of 3 distinct nonzero triangular numbers.
A004195 The numbers not expressible as the sum of 4 distinct nonzero squares can be written D*4^n union E. This is D.
A004196 The numbers not expressible as the sum of 4 distinct nonzero squares can be written D*4^n union E. This is E.
A005519 Let T(n,d) = number of distinct d-dimensional polyominoes (or polycubes) with n cells (A049429, A049430); sequence gives Sum_{d} T(n,d).
A006765 Number of polyominoes with n cells.
A006766 Number of 3-dimensional polyominoes with n cells.
A006767 Number of 4-dimensional polyominoes with n cells.
A006768 Number of 5-dimensional polyominoes with n cells.
A008062 a(n) = maximal value of m such that an n X m radar array exists. (A (0,1) matrix A such that any horizontal shift of A overlaps A in at most a single 1.)
A010672 A B_2 sequence: a(n) = least value such that sequence increases and pairwise sums of distinct elements are all distinct.
A011185 A B_2 sequence: a(n) = least value such that sequence increases and pairwise sums of distinct elements are all distinct.
A013989 a(n) = (n+1)( a(n-1)/n + a(n-2) ), with a(0)=1, a(1)=2.
A013990 Edge-disjoint paths between opposite corners of n X n grid.
A013991 Edge-disjoint paths between opposite corners of 2 X n grid.
A013992 Edge-disjoint paths between opposite corners of 3 X n grid.
A013993 Number of edge-disjoint paths between opposite corners of 4 X n grid.
A013994 Number of edge-disjoint paths between opposite corners of 5xn grid.
A013995 Number of edge-disjoint paths between opposite corners of 6xn grid.
A013996 Number of edge-disjoint paths between opposite corners of 7xn grid.
A013997 Number of edge-disjoint paths between opposite corners of 8xn grid.
A014597 Numbers n such that n^2 is a sum of distinct factorials.
A019312 Taxman sequence: define T(S) by max{x+T(S \ {c : c|x})}, where the max is over all x in S for which S also contains a proper divisor of x; if no such x exists, T(S)=0; set T(n)=T({1,...,n}).
A019313 e + 2 Pi.
A019315 Decimal expansion of e^Pi + Pi + e.
A025582 A B_2 sequence: a(n) = least value such that sequence increases and pairwise sums of elements are all distinct.
A030659 Smallest possible maximum denominator in an expression for 1 as a sum of n distinct unit (Egyptian) fractions.
A031121 Integer ratios of Fibonacci numbers F(m)/F(n).
A031122 Integers that appear as ratios of Fibonacci numbers F(kn)/F(k), but omitting Fibonacci numbers F(n)/F(1) and Lucas numbers F(2n)/F(n).
A031140 Position of rightmost 0 in 2^n increases.
A031141 Position of rightmost 0 in 2^A031140(n).
A031142 Position of rightmost 0 (including leading 0) in 2^n increases.
A031143 Position of rightmost 0 (including leading 0) in 2^A031142(n).
A033919 Odd k for which k+2^m is composite for all m < k.
A036556 Integers which when multiplied by 3 have an odd number of 1's in their binary expansion (cf. A000069).
A040173 Numerator of probability that 2 elements of S_n chosen at random (with replacement) generate S_n.
A040174 Denominator of probability that 2 elements of S_n chosen at random (with replacement) generate S_n.
A040175 n! times probability that an ordered pair of elements of S_n chosen at random (with replacement) generate S_n.
A045768 Numbers n such that sigma(n) == 2 (mod n).
A045769 Numbers n such that sigma(n) == 4 (mod n).
A045770 Numbers n such that sigma(n) == 8 (mod n).
A048663 Number of rooted polycubes with n cells, with no symmetries removed.
A048664 Number of rooted 2-dimensional polyominoes with n square cells, with no symmetries removed.
A048665 Number of rooted 4-dimensional "polycubes" with n cells, with no symmetries removed.
A048666 Number of rooted 5-dimensional "polycubes" with n cells, with no symmetries removed.
A048667 Number of rooted 6-dimensional "polycubes" with n cells, with no symmetries removed.
A048668 Number of rooted 7-dimensional "polycubes" with n cells, with no symmetries removed.
A048790 Array read by antidiagonals: T(n,k) = number of rooted n-dimensional polycubes with k cells, with no symmetries removed (n >= 1, k >= 1).
A049429 Triangle T(n,d) = number of distinct d-dimensional polyominoes (or polycubes) with n cells (n >= 2,d>=1).
A051738 Number of rooted 2-dimensional polyominoes with n pentagonal cells, with no symmetries removed.
A051801 Product of nonzero digits of n.
A051802 Nonzero multiplicative digital root of n.
A051803 Numbers with nonzero multiplicative digital root 1.
A051804 Numbers with nonzero multiplicative digital root 2.
A051805 Numbers with nonzero multiplicative digital root 3.
A051806 Numbers with nonzero multiplicative digital root 4.
A051807 Numbers with nonzero multiplicative digital root 5.
A051808 Numbers with nonzero multiplicative digital root 6.
A051809 Numbers with nonzero multiplicative digital root 7.
A051810 Numbers with nonzero multiplicative digital root 8.
A051811 Numbers with nonzero multiplicative digital root 9.
A051812 Number of n-digit numbers with nonzero multiplicative digital root 1.
A051813 Number of n-digit numbers with nonzero multiplicative digital root 2.
A051814 Number of n-digit numbers with nonzero multiplicative digital root 3.
A051815 Number of n-digit numbers with nonzero multiplicative digital root 4.
A051816 Number of n-digit numbers with nonzero multiplicative digital root 5.
A051817 Number of n-digit numbers with nonzero multiplicative digital root 6.
A051818 Number of n-digit numbers with nonzero multiplicative digital root 7.
A051819 Number of n-digit numbers with nonzero multiplicative digital root 8.
A051820 Number of n-digit numbers with nonzero multiplicative digital root 9.
A051821 Number of numbers below 10^n with nonzero multiplicative digital root 1 (not counting 0).
A051822 Number of numbers below 10^n with nonzero multiplicative digital root 2.
A051823 Number of numbers below 10^n with nonzero multiplicative digital root 3.
A051824 Number of numbers below 10^n with nonzero multiplicative digital root 4.
A051825 Number of numbers below 10^n with nonzero multiplicative digital root 5.
A051826 Number of numbers below 10^n with nonzero multiplicative digital root 6.
A051827 Number of numbers below 10^n with nonzero multiplicative digital root 7.
A051828 Number of numbers below 10^n with nonzero multiplicative digital root 8.
A051829 Number of numbers below 10^n with nonzero multiplicative digital root 9.
A074914 Order of group of n X n X n Rubik cube, under assumptions not-s, m, i.
A075152 Number of possible permutations of a Rubik cube of size n X n X n.
A080656 Order of group of n X n X n Rubik cube, under assumptions not-s, m, not-i.
A080658 Order of group of n X n X n Rubik cube, under assumptions not-s, not-m, i.
A080659 Order of group of n X n X n Rubik cube, under assumptions s, m, i.
A080660 Order of group of n X n X n Rubik cube, under assumptions s, m, not-i.
A080661 Order of group of n X n X n Rubik cube, under assumptions s, not-m, not-i.
A080662 Order of group of n X n X n Rubik cube, under assumptions s, not-m, i.
A087725 Maximal number of moves required for the n X n generalization of the sliding block 15-puzzle (or fifteen-puzzle).
A094100 Fit a polynomial of degree k-1 to column k of array in A048790, evaluate it at dimension n = -1.
A094101 Number of rooted 8-dimensional "polycubes" with n cells, with no symmetries removed.
A094159 3 times hexagonal numbers: 3*n*(2*n-1).
A094160 Column 4 of A048790.
A094161 Column 5 of A048790.
A094164 Number of rooted 2-dimensional polyominoes with n triangular cells, with no symmetries removed.
A094165 Number of rooted 2-dimensional polyominoes with n hexagonal cells, with no symmetries removed.
A094166 Array read by antidiagonals: T(n,k) = number of rooted 2-dimensional polyominoes with k cells, the cells being regular n-gons, with no symmetries removed.
A094168 Number of rooted 2-dimensional polyominoes with n heptagonal cells, with no symmetries removed.
A094169 Number of rooted 2-dimensional polyominoes with n octagonal cells, with no symmetries removed.
A143789 Lightest finite monotonically increasing sequence obtained by chunking an 18-digit Skolem-Langford integer (see A108116). There are d digits between two d's in the sequence.