Sequences
392,541 sequences
- All distinct primes dividing n are consecutive.A066311
All distinct primes dividing n are consecutive.
- Numbers, other than prime powers, whose distinct prime factors are consecutive primes.A066312
Numbers, other than prime powers, whose distinct prime factors are consecutive primes.
- Number of aperiodic necklaces with n red or blue beads such that two necklaces are equivalent under the operation of simultaneously turning the necklace over and switching the two colors.A066313
Number of aperiodic necklaces with n red or blue beads such that two necklaces are equivalent under the operation of simultaneously turning the necklace over and switching the two colors.
- Number of identity (asymmetric) bracelets (or necklaces) with n red or blue beads such that the beads switch colors when bracelet is turned over.A066314
Number of identity (asymmetric) bracelets (or necklaces) with n red or blue beads such that the beads switch colors when bracelet is turned over.
- Number of aperiodic bracelets (or necklaces) with n red and blue beads such that the beads switch colors when bracelet is turned over.A066315
Number of aperiodic bracelets (or necklaces) with n red and blue beads such that the beads switch colors when bracelet is turned over.
- Number of identity (asymmetric) bracelets (or necklaces) with n red and blue beads such that the beads switch colors when bracelet is turned over.A066316
Number of identity (asymmetric) bracelets (or necklaces) with n red and blue beads such that the beads switch colors when bracelet is turned over.
- Number of rooted identity (asymmetric) planar trees that can be turned over.A066317
Number of rooted identity (asymmetric) planar trees that can be turned over.
- Number of necklaces with n labeled beads of 2 colors.A066318
Number of necklaces with n labeled beads of 2 colors.
- A labeled structure simultaneously a tree and a cycle.A066319
A labeled structure simultaneously a tree and a cycle.
- Triangle read by rows: T(n, k) = binomial(n, k)*k^k*(n-k)^(n-k-1) k=0..n-1.A066320
Triangle read by rows: T(n, k) = binomial(n, k)*k^k*(n-k)^(n-k-1) k=0..n-1.
- Binary representation of base-(i-1) expansion of n: replace i-1 with 2 in base-(i-1) expansion of n.A066321
Binary representation of base-(i-1) expansion of n: replace i-1 with 2 in base-(i-1) expansion of n.
- Variable terms in period-16 pattern of first differences of binary representation of base i-1 expansion of n.A066322
Variable terms in period-16 pattern of first differences of binary representation of base i-1 expansion of n.
- Number of one bits in binary representation of base i-1 expansion of n (where i = sqrt(-1)).A066323
Number of one bits in binary representation of base i-1 expansion of n (where i = sqrt(-1)).
- Number of endofunctions on n labeled points constructed from k rooted trees.A066324
Number of endofunctions on n labeled points constructed from k rooted trees.
- Coefficients of unitary Hermite polynomials He_n(x).A066325
Coefficients of unitary Hermite polynomials He_n(x).
- a(1) = 5; for n > 1, a(n) is the least k > 0 not already included such that a(m)^2 + k^2 is a square for some m < n.A066326
a(1) = 5; for n > 1, a(n) is the least k > 0 not already included such that a(m)^2 + k^2 is a square for some m < n.
- Binary string which equals n when 1's, 2's, 4's and 8's bits have weights -1, 1, 3, 6 respectively, while the other bits have their usual weights. -1 if no such string exists.A066327
Binary string which equals n when 1's, 2's, 4's and 8's bits have weights -1, 1, 3, 6 respectively, while the other bits have their usual weights. -1 if no such string exists.
- a(n) = sum of indices of distinct prime factors of n; here, index(i-th prime) = i.A066328
a(n) = sum of indices of distinct prime factors of n; here, index(i-th prime) = i.
- Binary string which equals n when 1's, 2's, 4's and 8's bits have weights 1, 1, 3, 5 respectively, while the other bits have their usual weights. -1 if no such string exists.A066329
Binary string which equals n when 1's, 2's, 4's and 8's bits have weights 1, 1, 3, 5 respectively, while the other bits have their usual weights. -1 if no such string exists.
- Binary string which equals n when 1's, 2's, 4's and 8's bits have weights 1, 2, 4, 5 respectively, while the other bits have their usual weights. -1 if no such string exists.A066330
Binary string which equals n when 1's, 2's, 4's and 8's bits have weights 1, 2, 4, 5 respectively, while the other bits have their usual weights. -1 if no such string exists.
- Number of fixed hexagonal polyominoes with n cells and tree-like structure.A066331
Number of fixed hexagonal polyominoes with n cells and tree-like structure.
- a(1)=1; for n > 0, a(n+1) = rad(a(n))*n where rad=A007947.A066332
a(1)=1; for n > 0, a(n+1) = rad(a(n))*n where rad=A007947.
- a(n) = min(x : x^2 + n^2 = 0 mod (x+n-1)).A066333
a(n) = min(x : x^2 + n^2 = 0 mod (x+n-1)).
- Binary string which equals n when 1's, 2's, 4's and 8's bits have weights 1, 2, 4, 2 respectively, while the other bits have their usual weights. -1 if no such string exists.A066334
Binary string which equals n when 1's, 2's, 4's and 8's bits have weights 1, 2, 4, 2 respectively, while the other bits have their usual weights. -1 if no such string exists.
- Binary string which equals n when 1's and 2's bits have negative weights.A066335
Binary string which equals n when 1's and 2's bits have negative weights.
- Decimal equivalent of A066334.A066336
Decimal equivalent of A066334.
- Decimal equivalent of A066327.A066337
Decimal equivalent of A066327.
- Decimal equivalent of A066330.A066338
Decimal equivalent of A066330.
- Number of primes p of the form 4m+1 with p <= n.A066339
Number of primes p of the form 4m+1 with p <= n.
- Fermat's triangle: T(n,m) = m^phi(n) mod n; n >= 2; 1 <= m <= n-1, where phi is Euler's totient function.A066340
Fermat's triangle: T(n,m) = m^phi(n) mod n; n >= 2; 1 <= m <= n-1, where phi is Euler's totient function.
- Sum of distinct terms in n-th row of Fermat's triangle.A066341
Sum of distinct terms in n-th row of Fermat's triangle.
- Number of triangulations of the cyclic polytope C(n, n-4).A066342
Number of triangulations of the cyclic polytope C(n, n-4).
- Beatty sequence for log_2(10).A066343
Beatty sequence for log_2(10).
- Beatty sequence for log_5(10).A066344
Beatty sequence for log_5(10).
- Winning binary "same game" templates of length n as defined below.A066345
Winning binary "same game" templates of length n as defined below.
- Number of winning binary "same game" templates with ternary digits totaling n.A066346
Number of winning binary "same game" templates with ternary digits totaling n.
- Numbers k such that (the sum of digits of k!)+1 is a prime.A066347
Numbers k such that (the sum of digits of k!)+1 is a prime.
- Numbers n such that phi(n+2) - 2*phi(n+1) + phi(n) = -n.A066348
Numbers n such that phi(n+2) - 2*phi(n+1) + phi(n) = -n.
- A self-generating sequence: let S = {}, a(0) = 333; for n >= 1, factorize a(n-1), arrange prime factors in increasing order and append their digits to S; then a(n) is the 3-digit number formed from terms 3n, 3n+1, 3n+2 of S. Leading zeros are omitted from a(n).A066349
A self-generating sequence: let S = {}, a(0) = 333; for n >= 1, factorize a(n-1), arrange prime factors in increasing order and append their digits to S; then a(n) is the 3-digit number formed from terms 3n, 3n+1, 3n+2 of S. Leading zeros are omitted from a(n).
- Bisection of A007059.A066350
Bisection of A007059.
- Bisection of A007059.A066351
Bisection of A007059.
- Pillai sequence: a(n) is the smallest term in A007924 requiring n primes.A066352
Pillai sequence: a(n) is the smallest term in A007924 requiring n primes.
- 1 + partial sums of A032378.A066353
1 + partial sums of A032378.
- Number of hands that peg n points in the "show" phase of 6-card cribbage.A066354
Number of hands that peg n points in the "show" phase of 6-card cribbage.
- A055471(n)/(product of nonzero digits of A055471(n)).A066355
A055471(n)/(product of nonzero digits of A055471(n)).
- Numerator of sequence defined by recursion c(n) = 1 + c(n-2) / c(n-1), c(0) = 0, c(1) = 1.A066356
Numerator of sequence defined by recursion c(n) = 1 + c(n-2) / c(n-1), c(0) = 0, c(1) = 1.
- Number of ordered (i.e., planar) trees on 2n edges with every subtree at the root having an even number of edges.A066357
Number of ordered (i.e., planar) trees on 2n edges with every subtree at the root having an even number of edges.
- Recurring permutations: a(n) = P(a(n-1),a(n-2)) where P(x,y) = x!/(x-y)!.A066358
Recurring permutations: a(n) = P(a(n-1),a(n-2)) where P(x,y) = x!/(x-y)!.
- Nonsquarefree numbers n such that phi(n) = phi(n-2)-phi(n-1), where phi is Euler's totient function.A066359
Nonsquarefree numbers n such that phi(n) = phi(n-2)-phi(n-1), where phi is Euler's totient function.
- Number of unordered solutions in positive integers of xy + xz + yz = n with gcd(x,y,z) = 1.A066360
Number of unordered solutions in positive integers of xy + xz + yz = n with gcd(x,y,z) = 1.