Sequences
392,541 sequences
- Simple involution of natural numbers: complement [binary_width(n)/2] least significant bits in the binary expansion of n.A080261
Simple involution of natural numbers: complement [binary_width(n)/2] least significant bits in the binary expansion of n.
- Cunningham numbers: of the form a^b +- 1, where a, b >= 2.A080262
Cunningham numbers: of the form a^b +- 1, where a, b >= 2.
- A014486-encoding of the branch-reduced binomial-mod-2 binary trees.A080263
A014486-encoding of the branch-reduced binomial-mod-2 binary trees.
- A063171-encoding of the stunted binomial-mod-2 zigzag trees. See A080263.A080264
A063171-encoding of the stunted binomial-mod-2 zigzag trees. See A080263.
- A014486-index of the stunted binomial-mod-2 zigzag trees. See A080263.A080265
A014486-index of the stunted binomial-mod-2 zigzag trees. See A080263.
- a(n) = A080301(A080263(n)).A080266
a(n) = A080301(A080263(n)).
- a(n) = Sum_{d divides n} d*2^(n-n/d).A080267
a(n) = Sum_{d divides n} d*2^(n-n/d).
- Breadth-first-wise A014486-like encoding of the stunted binomial-mod-2 zigzag trees (A080263).A080268
Breadth-first-wise A014486-like encoding of the stunted binomial-mod-2 zigzag trees (A080263).
- Breadth-first-wise A063171-like-encoding of the stunted binomial-mod-2 zigzag trees (A080264).A080269
Breadth-first-wise A063171-like-encoding of the stunted binomial-mod-2 zigzag trees (A080264).
- Positions of A080268 in A014486.A080270
Positions of A080268 in A014486.
- a(n) = A080301(A080268(n)).A080271
a(n) = A080301(A080268(n)).
- Orbit size of each tree A080263(n) under Donaghey's "Map M" Catalan automorphism.A080272
Orbit size of each tree A080263(n) under Donaghey's "Map M" Catalan automorphism.
- Orbit size of each tree A080263(n) under Meeussen's bf<->df map on binary trees.A080273
Orbit size of each tree A080263(n) under Meeussen's bf<->df map on binary trees.
- Orbit size of each complete binary tree under Meeussen's bf<->df map on binary trees.A080274
Orbit size of each complete binary tree under Meeussen's bf<->df map on binary trees.
- a(n)=(-1)^n(1 - (1/12)n(n + 1)(12 - n + n^2)).A080275
a(n)=(-1)^n(1 - (1/12)n(n + 1)(12 - n + n^2)).
- Variation on Connell sequence (A001614). In this one, a(1)=1, terms a(n) onwards are generated in "blocks" as the next a(n-1) odd numbers > a(n-1) if the previous block ends with a(n-1) even and the next a(n-1) even numbers > a(n-1) if the previous block ends with a(n-1) odd.A080276
Variation on Connell sequence (A001614). In this one, a(1)=1, terms a(n) onwards are generated in "blocks" as the next a(n-1) odd numbers > a(n-1) if the previous block ends with a(n-1) even and the next a(n-1) even numbers > a(n-1) if the previous block ends with a(n-1) odd.
- Partial sums of A038712.A080277
Partial sums of A038712.
- a(n) = (3^(v_3(n) + 1) - 1)/2, where v_3(n) = highest power of 3 dividing n = A007949(n).A080278
a(n) = (3^(v_3(n) + 1) - 1)/2, where v_3(n) = highest power of 3 dividing n = A007949(n).
- Numbers n such that 1/G^n is closer to its nearest integer than any value of 1/G^k for 1 <= k < n, where G is Catalan's constant.A080279
Numbers n such that 1/G^n is closer to its nearest integer than any value of 1/G^k for 1 <= k < n, where G is Catalan's constant.
- Numbers n such that Pi^(n*e)-e^n is closer to its nearest integer than any value of Pi^(k*e)-e^k for 1 <= k < n.A080280
Numbers n such that Pi^(n*e)-e^n is closer to its nearest integer than any value of Pi^(k*e)-e^k for 1 <= k < n.
- Numbers k such that Pi^k - 1/phi is closer to its nearest integer than any value of Pi^j - 1/phi for 1 <= j < k.A080281
Numbers k such that Pi^k - 1/phi is closer to its nearest integer than any value of Pi^j - 1/phi for 1 <= j < k.
- Numbers n such that log(n) + log_10(n) is closer to its nearest integer than any value of log(k) + log_10(k) for 1 < = k < n.A080282
Numbers n such that log(n) + log_10(n) is closer to its nearest integer than any value of log(k) + log_10(k) for 1 < = k < n.
- Numbers n such that (log(n)/Pi)^2 is closer to its nearest integer than any value of (log(k)/Pi)^2 for 1 <= k < n.A080283
Numbers n such that (log(n)/Pi)^2 is closer to its nearest integer than any value of (log(k)/Pi)^2 for 1 <= k < n.
- Numbers n such that (Pi/e)^n is closer to its nearest integer than any value of (Pi/e)^k for 1 <= k < n.A080284
Numbers n such that (Pi/e)^n is closer to its nearest integer than any value of (Pi/e)^k for 1 <= k < n.
- Numbers n such that [(Pi+e)/(Pi-e)]^n is closer to its nearest integer than any value of [(Pi+e)/(Pi-e)]^k for 1 <= k < n.A080285
Numbers n such that [(Pi+e)/(Pi-e)]^n is closer to its nearest integer than any value of [(Pi+e)/(Pi-e)]^k for 1 <= k < n.
- Numbers m such that (Pi+e)^m is closer to its nearest integer than any value of (Pi+e)^k for 1 <= k < m.A080286
Numbers m such that (Pi+e)^m is closer to its nearest integer than any value of (Pi+e)^k for 1 <= k < m.
- Successively larger gaps in Ulam numbers start at this Ulam number.A080287
Successively larger gaps in Ulam numbers start at this Ulam number.
- Successively larger gaps between Ulam numbers.A080288
Successively larger gaps between Ulam numbers.
- Integers n for which the ratio phi(n)/pi(n) is smaller than for any subsequent n. Here phi(n) is Euler's totient function and pi(n) is the number of primes that are at most n.A080289
Integers n for which the ratio phi(n)/pi(n) is smaller than for any subsequent n. Here phi(n) is Euler's totient function and pi(n) is the number of primes that are at most n.
- a(n) = n^n * (n + 2 - (1/12) * (n^2-1)).A080290
a(n) = n^n * (n + 2 - (1/12) * (n^2-1)).
- a(n) = (-1)^(n+1) * n^n * (n + (1/12) * (n^2-1)).A080291
a(n) = (-1)^(n+1) * n^n * (n + (1/12) * (n^2-1)).
- Orbit size of each tree A080293(n) under Donaghey's "Map M" Catalan automorphism.A080292
Orbit size of each tree A080293(n) under Donaghey's "Map M" Catalan automorphism.
- A014486-encoding of the branch-reduced binomial-mod-2 binary trees.A080293
A014486-encoding of the branch-reduced binomial-mod-2 binary trees.
- A063171-encoding of the branch-reduced binomial-mod-2 binary trees.A080294
A063171-encoding of the branch-reduced binomial-mod-2 binary trees.
- A014486-index of the branch-reduced binomial-mod-2 binary trees.A080295
A014486-index of the branch-reduced binomial-mod-2 binary trees.
- a(n) = A080301(A080293(n)).A080296
a(n) = A080301(A080293(n)).
- Orbit size of each tree A080293(n) under Meeussen's bf<->df map on binary trees.A080297
Orbit size of each tree A080293(n) under Meeussen's bf<->df map on binary trees.
- Positions of A080299 in A014486.A080298
Positions of A080299 in A014486.
- A014486-encoding of plane binary trees (Stanley's d) whose interior zigzag-tree (Stanley's c, i.e., tree obtained by discarding the outermost edges of the binary tree) is isomorphic to a valid plane binary tree (Stanley's d).A080299
A014486-encoding of plane binary trees (Stanley's d) whose interior zigzag-tree (Stanley's c, i.e., tree obtained by discarding the outermost edges of the binary tree) is isomorphic to a valid plane binary tree (Stanley's d).
- Global ranking function for totally balanced binary sequences.A080300
Global ranking function for totally balanced binary sequences.
- Local ranking function for totally balanced binary sequences: if n's binary expansion is totally balanced (A080116(n)=1), then a(n) is its zero-based position among A000108((A000523(n)+1)/2) lexicographically ordered totally balanced binary sequences of the same width, otherwise -1.A080301
Local ranking function for totally balanced binary sequences: if n's binary expansion is totally balanced (A080116(n)=1), then a(n) is its zero-based position among A000108((A000523(n)+1)/2) lexicographically ordered totally balanced binary sequences of the same width, otherwise -1.
- a(n) = A080292(n)/3.A080302
a(n) = A080292(n)/3.
- Rewrite 0->100 in the binary expansion of n.A080303
Rewrite 0->100 in the binary expansion of n.
- Numerator of n^mu(n), where mu is the Moebius function (A008683).A080304
Numerator of n^mu(n), where mu is the Moebius function (A008683).
- Denominator of n^mu(n), where mu is the Moebius function (A008683).A080305
Denominator of n^mu(n), where mu is the Moebius function (A008683).
- Numerator of Sum(k^mu(k): 1<=k<=n), where mu is the Moebius function (A008683).A080306
Numerator of Sum(k^mu(k): 1<=k<=n), where mu is the Moebius function (A008683).
- Multiples of the Fermat numbers 2^(2^n)+1.A080307
Multiples of the Fermat numbers 2^(2^n)+1.
- Non-multiples of Fermat numbers 2^(2^n)+1.A080308
Non-multiples of Fermat numbers 2^(2^n)+1.
- n-th even number equals n-th multiple of a Fermat number.A080309
n-th even number equals n-th multiple of a Fermat number.
- a(0) = 2 and, for n >= 1, rewrite 0->100 in the binary expansion of n and append 10 to the right.A080310
a(0) = 2 and, for n >= 1, rewrite 0->100 in the binary expansion of n and append 10 to the right.