Sequences
392,541 sequences
- Number of n-step walks (each step +-1 starting from 0) which are never more than 2 or less than -2.A068911
Number of n-step walks (each step +-1 starting from 0) which are never more than 2 or less than -2.
- Number of n step walks (each step +/-1 starting from 0) which are never more than 3 or less than -3.A068912
Number of n step walks (each step +/-1 starting from 0) which are never more than 3 or less than -3.
- Square array read by antidiagonals of number of k step walks (each step +-1 starting from 0) which are never more than n or less than -n.A068913
Square array read by antidiagonals of number of k step walks (each step +-1 starting from 0) which are never more than n or less than -n.
- Square array read by antidiagonals of number of k step walks (each step +-1 starting from 0) which are never more than n or less than 0.A068914
Square array read by antidiagonals of number of k step walks (each step +-1 starting from 0) which are never more than n or less than 0.
- a(n) = n if n<2; a(n) = |a(n/2)-a(n/2-1)| if n is even, and a(n) = a((n-1)/2) + a((n-1)/2+1) if n is odd.A068915
a(n) = n if n<2; a(n) = |a(n/2)-a(n/2-1)| if n is even, and a(n) = a((n-1)/2) + a((n-1)/2+1) if n is odd.
- Smallest positive integer that is equal to the sum of the n-th powers of its prime factors (counted with multiplicity).A068916
Smallest positive integer that is equal to the sum of the n-th powers of its prime factors (counted with multiplicity).
- Numerators of coefficients in 1/sin(x) - 1/sinh(x) power series.A068917
Numerators of coefficients in 1/sin(x) - 1/sinh(x) power series.
- Denominators of coefficients in 1/sin(x) - 1/sinh(x) power series.A068918
Denominators of coefficients in 1/sin(x) - 1/sinh(x) power series.
- Squarefree orders of non-Abelian groups.A068919
Squarefree orders of non-Abelian groups.
- Table of t(r,s) read by antidiagonals: t(r,s) is the number of ways to tile an r X s room with 1 X 2 Tatami mats. At most 3 Tatami mats may meet at a point.A068920
Table of t(r,s) read by antidiagonals: t(r,s) is the number of ways to tile an r X s room with 1 X 2 Tatami mats. At most 3 Tatami mats may meet at a point.
- Number of ways to tile a 2 X n room with 1 X 2 Tatami mats. At most 3 Tatami mats may meet at a point.A068921
Number of ways to tile a 2 X n room with 1 X 2 Tatami mats. At most 3 Tatami mats may meet at a point.
- Number of ways to tile a 3 X 2n room with 1 X 2 Tatami mats. At most 3 Tatami mats may meet at a point.A068922
Number of ways to tile a 3 X 2n room with 1 X 2 Tatami mats. At most 3 Tatami mats may meet at a point.
- Number of ways to tile a 4 X n room with 1x2 Tatami mats. At most 3 Tatami mats may meet at a point.A068923
Number of ways to tile a 4 X n room with 1x2 Tatami mats. At most 3 Tatami mats may meet at a point.
- Number of ways to tile a 5 X 2n room with 1x2 Tatami mats. At most 3 Tatami mats may meet at a point.A068924
Number of ways to tile a 5 X 2n room with 1x2 Tatami mats. At most 3 Tatami mats may meet at a point.
- Number of ways to tile a 6 X n room with 1x2 Tatami mats. At most 3 Tatami mats may meet at a point.A068925
Number of ways to tile a 6 X n room with 1x2 Tatami mats. At most 3 Tatami mats may meet at a point.
- Table read by antidiagonals: ti(r,s) is the number of incongruent ways to tile an r X s room with 1 X 2 Tatami mats. At most 3 Tatami mats may meet at a point.A068926
Table read by antidiagonals: ti(r,s) is the number of incongruent ways to tile an r X s room with 1 X 2 Tatami mats. At most 3 Tatami mats may meet at a point.
- Number of incongruent ways to tile a 2 X n room with 1 X 2 Tatami mats. At most 3 Tatami mats may meet at a point.A068927
Number of incongruent ways to tile a 2 X n room with 1 X 2 Tatami mats. At most 3 Tatami mats may meet at a point.
- Number of incongruent ways to tile a 3 X 2n room with 1x2 Tatami mats. At most 3 Tatami mats may meet at a point.A068928
Number of incongruent ways to tile a 3 X 2n room with 1x2 Tatami mats. At most 3 Tatami mats may meet at a point.
- Number of incongruent ways to tile a 4 X n room with 1 X 2 Tatami mats. At most 3 Tatami mats may meet at a point.A068929
Number of incongruent ways to tile a 4 X n room with 1 X 2 Tatami mats. At most 3 Tatami mats may meet at a point.
- Number of incongruent ways to tile a 5 X 2n room with 1x2 Tatami mats. At most 3 Tatami mats may meet at a point.A068930
Number of incongruent ways to tile a 5 X 2n room with 1x2 Tatami mats. At most 3 Tatami mats may meet at a point.
- Number of incongruent ways to tile a 6 X n room with 1x2 Tatami mats. At most 3 Tatami mats may meet at a point.A068931
Number of incongruent ways to tile a 6 X n room with 1x2 Tatami mats. At most 3 Tatami mats may meet at a point.
- Number of disconnected regular graphs with n nodes.A068932
Number of disconnected regular graphs with n nodes.
- Triangular array D(n, r) = number of disconnected r-regular graphs with n nodes, 0 <= r < n.A068933
Triangular array D(n, r) = number of disconnected r-regular graphs with n nodes, 0 <= r < n.
- Triangular array C(n, r) = number of connected r-regular graphs with n nodes, 0 <= r < n.A068934
Triangular array C(n, r) = number of connected r-regular graphs with n nodes, 0 <= r < n.
- Numbers having the sum of distinct prime factors less than the sum of exponents in prime factorization, A008472(n) < A001222(n).A068935
Numbers having the sum of distinct prime factors less than the sum of exponents in prime factorization, A008472(n) < A001222(n).
- Numbers having the sum of distinct prime factors not greater than the sum of exponents in prime factorization, A008472(k) <= A001222(k).A068936
Numbers having the sum of distinct prime factors not greater than the sum of exponents in prime factorization, A008472(k) <= A001222(k).
- Numbers having the sum of distinct prime factors not less than the sum of exponents in prime factorization, A008472(n)>=A001222(n).A068937
Numbers having the sum of distinct prime factors not less than the sum of exponents in prime factorization, A008472(n)>=A001222(n).
- Numbers having the sum of distinct prime factors greater than the sum of exponents in prime factorization, A008472(n)>A001222(n).A068938
Numbers having the sum of distinct prime factors greater than the sum of exponents in prime factorization, A008472(n)>A001222(n).
- a(n) = Bell(n^2), where Bell(n) are the Bell numbers, cf. A000110.A068939
a(n) = Bell(n^2), where Bell(n) are the Bell numbers, cf. A000110.
- Maximum number of chess queens that can be placed on a 3-dimensional chessboard of order n so that no two queens attack each other.A068940
Maximum number of chess queens that can be placed on a 3-dimensional chessboard of order n so that no two queens attack each other.
- Maximum number of chess queens that can be placed on a 4-dimensional chessboard of order n so that no two attack each other.A068941
Maximum number of chess queens that can be placed on a 4-dimensional chessboard of order n so that no two attack each other.
- a(n) = Bo(n^2), n=0,1..., where Bo(n) are the ordered Bell numbers, A000670.A068942
a(n) = Bo(n^2), n=0,1..., where Bo(n) are the ordered Bell numbers, A000670.
- a(n) = f(n, n, n), where f is the generalized super falling factorial (see comments for definition.).A068943
a(n) = f(n, n, n), where f is the generalized super falling factorial (see comments for definition.).
- Highest power of 9 dividing A068943(n) for n>0.A068944
Highest power of 9 dividing A068943(n) for n>0.
- Number of ones in the binary expansion of A068943(n).A068945
Number of ones in the binary expansion of A068943(n).
- Number of digits in A068943.A068946
Number of digits in A068943.
- Square roots of A068809.A068947
Square roots of A068809.
- Primes in A068947.A068948
Primes in A068947.
- Digit sums of A068809.A068949
Digit sums of A068809.
- Digital roots of A068809.A068950
Digital roots of A068809.
- Scan the primes, record digit-sum if it is itself prime.A068951
Scan the primes, record digit-sum if it is itself prime.
- Squares in A068949.A068952
Squares in A068949.
- Number of bases B (2 <= B <= n) such that every digit of n in base B is 0 or 1.A068953
Number of bases B (2 <= B <= n) such that every digit of n in base B is 0 or 1.
- Smallest prime factor of n^n-(n-1)^(n-1).A068954
Smallest prime factor of n^n-(n-1)^(n-1).
- Greatest prime factor of n^n - (n-1)^(n-1).A068955
Greatest prime factor of n^n - (n-1)^(n-1).
- Number of distinct prime factors of n^n - (n-1)^(n-1).A068956
Number of distinct prime factors of n^n - (n-1)^(n-1).
- Number of prime divisors of n^n - (n-1)^(n-1), counted with multiplicity.A068957
Number of prime divisors of n^n - (n-1)^(n-1), counted with multiplicity.
- Smallest value of k such that p | (10^k + 1), where p is the n-th prime; or 0 if no such k exists.A068958
Smallest value of k such that p | (10^k + 1), where p is the n-th prime; or 0 if no such k exists.
- Decimal expansion of the smallest solution > Pi/2 to sin(x)=sin(x^2).A068959
Decimal expansion of the smallest solution > Pi/2 to sin(x)=sin(x^2).
- Decimal expansion of the fifth smallest positive real root of sin(x) - sin(x^3) = 0.A068960
Decimal expansion of the fifth smallest positive real root of sin(x) - sin(x^3) = 0.