Summary of block A330
Sequences in block A330
Section titled “Sequences in block A330”-
A330000: Beatty sequence for sqrt(x+1), where 1/sqrt(x-1) + 1/sqrt(x+1) = 1.
-
A330002: Beatty sequence for x, where 1/x + 1/(x+1)^2 = 1.
-
A330003: Beatty sequence for (x+1)^2, where 1/x + 1/(x+1)^2 = 1.
-
A330022: Length of shortest binary string containing, as contiguous blocks, all palindromes of length n.
-
A330025: a(n) = (-1)^floor(n/5) * sign(mod(n, 5)).
-
A330063: Beatty sequence for x, where 1/x + sech(x) = 1.
-
A330064: Beatty sequence for cosh(x), where 1/x + sech(x) = 1.
-
A330066: Beatty sequence for x, where 1/x + csch(x) = 1.
-
A330067: Beatty sequence for sinh(x), where 1/x + 1/sinh(x) = 1.
-
A330085: Length of longest binary word with the property that all distinct occurrences of identical-length blocks agree on at most n positions.
-
A330094: Beatty sequence for 2^x, where 1/2^x + 1/3^(x-1) = 1.
-
A330095: Beatty sequence for 3^(x-1), where 1/2^x + 1/3^(x-1) = 1.
-
A330112: Beatty sequence for e^x, where 1/e^x + sech(x) = 1.
-
A330113: Beatty sequence for cosh(x), where 1/e^x + sech(x) = 1.
-
A330115: Beatty sequence for e^x, where 1/e^x + csch(x) = 1.
-
A330116: Beatty sequence for sinh(x), where 1/e^x + csch(x) = 1.
-
A330117: Beatty sequence for 1+x, where 1/(1+x) + 1/(1+x+x^2) = 1.
-
A330118: Beatty sequence for 1+x+x^2, where 1/(1+x) + 1/(1+x+x^2) = 1.
-
A330133: a(n) = (1/16)*(5 + (-1)^(1+n) - 4*cos(n*Pi/2) + 10*n^2).
-
A330135: a(n) = ((10^(n+1))^4 - 1)/9999 for n >= 0.
-
A330143: Beatty sequence for (3/2)^x, where (2/3)^x + (2/5)^x = 1.
-
A330144: Beatty sequence for (5/2)^x, where (2/3)^x + (2/5)^x = 1.
-
A330151: Partial sums of 4th powers of the even numbers.
-
A330170: a(n) = 2^n + 3^n + 6^n - 1.
-
A330172: a(n) = n + floor(nr/t) + floor(ns/t), where r = sqrt(2) - 1, s = sqrt(2), t = sqrt(2) + 1.
-
A330173: a(n) = n + floor(ns/r) + floor(nt/r), where r = sqrt(2), s = sqrt(2) + 1, t = sqrt(2) + 2.
-
A330179: a(n) = n + floor(ns/r) + floor(nt/r), where r = e - 1, s = e, t = e + 1.
-
A330197: Number of scalene triangles whose vertices are the vertices of a regular n-gon.
-
A330229: Number of fully chiral set-systems covering n vertices.
-
A330246: a(n) = 4^(n+1) + (4^n-1)/3.
-
A330280: Least number of 2 X 2 rotations required to solve an n X n Simon Tatham’s Twiddle puzzle.
-
A330294: Number of non-isomorphic fully chiral set-systems on n vertices.
-
A330295: Number of non-isomorphic fully chiral set-systems covering n vertices.
-
A330298: a(n) is the number of subsets of {1..n} that contain exactly 1 odd and 2 even numbers.
-
A330346: Number of unlabeled simple graphs covering n vertices with exactly two automorphisms.
-
A330357: a(n) = (2*n^2 + 9 - (-1)^n)/4.
-
A330390: G.f.: (1 + 15*x) / (1 - 2*x - 17*x^2).
-
A330396: Permutation of the nonnegative integers partitioned into triples [3*k+2, 3*k+1, 3*k] for k >= 0.
-
A330405: a(1) = 0; thereafter a(n) = (a(n-1)^2+1) mod n.
-
A330442: The number of free polyominoes with n cells which, when drawn on a 2D square grid, contain an Eulerian path.
-
A330451: a(n) = a(n-3) + 20*n - 30 for n > 2, with a(0)=0, a(1)=3, a(2)=13.
-
A330474: Number of non-isomorphic balanced reduced multisystems of weight n.
-
A330520: Sum of even integers <= n times the sum of odd integers <= n.
-
A330555: Coordination sequence for 1-skeleton of icosidodecahedron.
-
A330564: Coordination sequence for 1-skeleton of small stellated dodecahedron with respect to a trivalent node (a valley).
-
A330565: The thirteen entries from A005848 for which the integers of the cyclotomic field form a Euclidean ring with respect to the norm.
-
A330581: a(0) = 2; thereafter a(n) = a(n - 1)^n + 1.
-
A330602: a(n) = a(n-1) XOR (n+1), with a(0) = 0.
-
A330651: a(n) = n^4 + 3*n^3 + 2*n^2 - 2*n.
-
A330700: a(n) = (n - 1)*n*(2*n^2 + 4*n - 1)/6.
-
A330706: Numbers m such that the prime factorization of m! contains no composite exponents.
-
A330707: a(n) = ( 3*n^2 + n - 1 + (-1)^floor(n/2) )/4.
-
A330795: Evaluation of the polynomials given by the Riordan square of the Fibonacci sequence with a(0) = 1 (A193737) at 1/2 and normalized with 2^n.
-
A330797: Evaluation of the Stirling cycle polynomials at -1/2 and normalized with (-2)^n.
-
A330825: Numbers of the form 2^(2^k)*F_k, where F_k is a Fermat prime, A019434.
-
A330826: Numbers of the form 2^((2^n)+1)*F_n, where F_n is a Fermat prime, A019434.
-
A330828: The squares of the Fermat primes, (A019434(n))^2.
-
A330830: Numbers of the form (F_n-2)^2*F_n^2, where F_n is a Fermat prime, A019434. Also the first element of the power-spectral basis of A330829.
-
A330881: Length of longest LB factorization over all binary strings of length n.
-
A330987: Alternatively add and half-multiply pairs of the nonnegative integers.
-
A330990: Numbers whose inverse prime shadow (A181821) has its number of factorizations into factors > 1 (A001055) equal to a power of 2 (A000079).