Sequences
392,541 sequences
- Duplicate of A027856.A059961
Duplicate of A027856.
- Duplicate of A057605.A059962
Duplicate of A057605.
- Triangle T(n,k) giving number of ways of placing n nonattacking queens on n X n board with the queen on the first row fixed at column k, 1<=k<=n.A059963
Triangle T(n,k) giving number of ways of placing n nonattacking queens on n X n board with the queen on the first row fixed at column k, 1<=k<=n.
- a(1) = 1, a(2) = 1, a(n) = a(n-p) + a((n+1)-p), n > 2, where p is the largest prime less than n.A059964
a(1) = 1, a(2) = 1, a(n) = a(n-p) + a((n+1)-p), n > 2, where p is the largest prime less than n.
- For m>0, each n+m > 5 is expressed as Sum_{k = x,y,z}(pk)_m where (pk)_m is a prime with x <= y <= z; a(n) = largest m such that (pk)_1 = (pk)_2 = ... = (pk)_m.A059965
For m>0, each n+m > 5 is expressed as Sum_{k = x,y,z}(pk)_m where (pk)_m is a prime with x <= y <= z; a(n) = largest m such that (pk)_1 = (pk)_2 = ... = (pk)_m.
- a(n) = (1/n) * Sum_{ d divides n } mu(n/d) * (2^d - 1).A059966
a(n) = (1/n) * Sum_{ d divides n } mu(n/d) * (2^d - 1).
- Number of 9-ary trees.A059967
Number of 9-ary trees.
- Number of 10-ary trees.A059968
Number of 10-ary trees.
- a(n) = n times the number of letters in n (in English).A059969
a(n) = n times the number of letters in n (in English).
- Nim-factorials: a(1)=1 and, for n>1, a(n)=n*a(n-1), where * denotes Nim multiplication.A059970
Nim-factorials: a(1)=1 and, for n>1, a(n)=n*a(n-1), where * denotes Nim multiplication.
- n^n using Nim multiplication.A059971
n^n using Nim multiplication.
- a(n) is the least positive integer k such that all digits of k are 0 or 1 in exactly n different bases B, where 2 <= B <= k; i.e., such that A068953(k)=n.A059972
a(n) is the least positive integer k such that all digits of k are 0 or 1 in exactly n different bases B, where 2 <= B <= k; i.e., such that A068953(k)=n.
- Expansion of x*(1 + x - 2*x^2) / ( 1 - 4*x^2 - x^4).A059973
Expansion of x*(1 + x - 2*x^2) / ( 1 - 4*x^2 - x^4).
- a(n)=a(p)+a(q) where p and q are the two primes less than n and closest to n; with a(1)=1, a(2)=1, a(3) = 1.A059974
a(n)=a(p)+a(q) where p and q are the two primes less than n and closest to n; with a(1)=1, a(2)=1, a(3) = 1.
- For n > 1, a(n) is the least number of prime factors (counted with multiplicity) of any integer with n divisors; fully additive with a(p) = p-1.A059975
For n > 1, a(n) is the least number of prime factors (counted with multiplicity) of any integer with n divisors; fully additive with a(p) = p-1.
- Number of 3 X 3 determinants with elements from {0,...,n} and having the value zero.A059976
Number of 3 X 3 determinants with elements from {0,...,n} and having the value zero.
- a(n) = binomial(n+2, 2)^4.A059977
a(n) = binomial(n+2, 2)^4.
- a(n) = binomial(n+2,n)^6.A059978
a(n) = binomial(n+2,n)^6.
- Number of 7-dimensional cage assemblies.A059979
Number of 7-dimensional cage assemblies.
- Number of 8-dimensional cage assemblies.A059980
Number of 8-dimensional cage assemblies.
- Order of compositeness for the n-th composite number.A059981
Order of compositeness for the n-th composite number.
- Symmetric array of numeric partitions related to 1 4 9 16 ... and 1 3 4 7 13 ..., read by rows.A059982
Symmetric array of numeric partitions related to 1 4 9 16 ... and 1 3 4 7 13 ..., read by rows.
- First occurrence of n in A007599.A059983
First occurrence of n in A007599.
- Concatenation of Łukasiewicz words.A059984
Concatenation of Łukasiewicz words.
- Łukasiewicz words as integers written in factorial base.A059985
Łukasiewicz words as integers written in factorial base.
- Number of rods required to make a 3-D cube of side length n.A059986
Number of rods required to make a 3-D cube of side length n.
- Lucky numbers generated from primes.A059987
Lucky numbers generated from primes.
- a(n) = (10^n - 1)^2.A059988
a(n) = (10^n - 1)^2.
- Numbers k such that 3*k+1 and 4*k+1 are both squares.A059989
Numbers k such that 3*k+1 and 4*k+1 are both squares.
- Number of points of period n under the dual of the map x->2x on Z[1/6].A059990
Number of points of period n under the dual of the map x->2x on Z[1/6].
- a(n) = 2^(n-2^ord_2(n)) (or 2^(n-A006519(n))).A059991
a(n) = 2^(n-2^ord_2(n)) (or 2^(n-A006519(n))).
- Numbers with an increasing number of nonprime divisors.A059992
Numbers with an increasing number of nonprime divisors.
- Pinwheel numbers: a(n) = 2*n^2 + 6*n + 1.A059993
Pinwheel numbers: a(n) = 2*n^2 + 6*n + 1.
- Positions where number of periodic partitions increases.A059994
Positions where number of periodic partitions increases.
- Drop the final digit of n.A059995
Drop the final digit of n.
- Concatenate Catalan numbers (A000108).A059996
Concatenate Catalan numbers (A000108).
- a(n) = (n/2)*(n + 1)*(3*n + 11).A059997
a(n) = (n/2)*(n + 1)*(3*n + 11).
- Number of different primes occurring when n is expressed as p1+q1+r1 = ... = pk+qk+rk where pk,qk,rk are primes with pk <= qk <= rk.A059998
Number of different primes occurring when n is expressed as p1+q1+r1 = ... = pk+qk+rk where pk,qk,rk are primes with pk <= qk <= rk.
- a(n) = (1/6)*n^5 - (19/8)*n^4 + (51/4)*n^3 - (253/8)*n^2 + (445/12)*n - 14.A059999
a(n) = (1/6)*n^5 - (19/8)*n^4 + (51/4)*n^3 - (253/8)*n^2 + (445/12)*n - 14.
- If the numbers a(1)...a(n) contain a hole, then a(n+1) is the smallest hole; otherwise a(n+1) = a(n-1) + a(n).A060000
If the numbers a(1)...a(n) contain a hole, then a(n+1) is the smallest hole; otherwise a(n+1) = a(n-1) + a(n).
- a(n) = Fibonacci(n)!.A060001
a(n) = Fibonacci(n)!.
- Digitized partition numbers: numbers with (weakly) increasing digits ordered by sum of their digits then by the numbers themselves.A060002
Digitized partition numbers: numbers with (weakly) increasing digits ordered by sum of their digits then by the numbers themselves.
- Odd numbers not of the form p + 2*k^2, k>0, p prime.A060003
Odd numbers not of the form p + 2*k^2, k>0, p prime.
- a(n) = least odd number which can be represented in the form p + 2*k^2, k>0, in n different ways.A060004
a(n) = least odd number which can be represented in the form p + 2*k^2, k>0, in n different ways.
- Number of ways of partitioning the integers {1,2,..,4n} into two (unordered) sets such that the sums of parts are equal in both sets (parts in either set will add up to (4n)*(4n+1)/4). Number of solutions to {1 +- 2 +- 3 +- ... +- 4n=0}.A060005
Number of ways of partitioning the integers {1,2,..,4n} into two (unordered) sets such that the sums of parts are equal in both sets (parts in either set will add up to (4n)*(4n+1)/4). Number of solutions to {1 +- 2 +- 3 +- ... +- 4n=0}.
- Decimal expansion of real root of x^3 - x - 1 (the plastic constant).A060006
Decimal expansion of real root of x^3 - x - 1 (the plastic constant).
- Decimal expansion of the positive real root of x^4 - x - 1.A060007
Decimal expansion of the positive real root of x^4 - x - 1.
- a(n) = 9*binomial(n,4) = 3*n*(n-1)*(n-2)*(n-3)/8.A060008
a(n) = 9*binomial(n,4) = 3*n*(n-1)*(n-2)*(n-3)/8.
- Ulam numbers starting with the numbers 1 and 9.A060009
Ulam numbers starting with the numbers 1 and 9.
- Number of 2n-move sequences on the 3 X 3 X 3 Rubik's Cube (only quarter-twists count as moves) that leave the cube unchanged.A060010
Number of 2n-move sequences on the 3 X 3 X 3 Rubik's Cube (only quarter-twists count as moves) that leave the cube unchanged.