Skip to content

Summary of block A285

47 sequences
  • A285009: Subset sums (see Comments).

  • A285043: Expansion of cosh(3*arctanh(2*sqrt(x))).

  • A285074: Positions of 0 in A285073; complement of A285075.

  • A285075: Positions of 1 in A285073; complement of A285074.

  • A285077: Positions of 0 in A285076; complement of A285078.

  • A285078: Positions of 1 in A285076; complement of A285077.

  • A285086: Numbers n such that the number of partitions of n^2+1 (=A000041(n^2+1)) is prime.

  • A285173: Numbers n such that A002496(n+1) < A002496(n)^(1+1/n).

  • A285188: a(n) = Sum_{k=1..n} (k^2*floor(k/2)).

  • A285193: Expansion of 1/(1+x+2*x^2) mod 3.

  • A285194: Expansion of (1+x^2)/(1+x+x^4) mod 3.

  • A285197: Expansion of (1-6*x+11*x^2-5*x^3) / ((1-x)*(1-3*x)*(1-3*x+x^2)).

  • A285198: Binomial coefficients C(9,n).

  • A285201: Stage at which Ken Knowlton’s elevator (version 1) reaches floor n for the first time.

  • A285264: Decimal expansion of the mass energy equivalent of the charged pions pi^+ and pi^- in MeV.

  • A285265: Decimal expansion of the mass energy equivalent of the neutral pion pi^0 in MeV.

  • A285326: a(0) = 0, for n > 0, a(n) = n + A006519(n).

  • A285383: Limiting 0-word of the morphism 0 -> 11, 1 -> 01.

  • A285384: Limiting 1-word of the morphism 0 -> 11, 1 -> 01.

  • A285391: Start with a single cell at coordinates (0, 0), then iteratively subdivide the grid into 3 X 3 cells and remove the cells whose sum of modulo 2 coordinates is 2; a(n) is the number of cells after n iterations.

  • A285393: Start with a single cell at coordinates (0, 0, 0), then iteratively subdivide the grid into 3 X 3 X 3 cells and remove the cells whose sum of modulo 2 coordinates is 2 or 3; a(n) is the number of cells after n iterations.

  • A285399: Start with a single cell at coordinates (0, 0, 0), then iteratively subdivide the grid into 3 X 3 X 3 cells and remove the cells whose sum of modulo 2 coordinates is 0 or 2; a(n) is the number of cells after n iterations.

  • A285400: Start with a single cell at coordinates (0, 0, 0), then iteratively subdivide the grid into 3 X 3 X 3 cells and remove the cells whose sum of modulo 2 coordinates is 0 or 3; a(n) is the number of cells after n iterations.

  • A285440: Consider the sums of the numbers < n that share the same greatest common divisor with n. Sequence lists numbers that have only one of those sums equal to n.

  • A285473: Binary representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by “Rule 3”, based on the 5-celled von Neumann neighborhood.

  • A285474: Binary representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by “Rule 3”, based on the 5-celled von Neumann neighborhood.

  • A285475: Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by “Rule 3”, based on the 5-celled von Neumann neighborhood.

  • A285476: Binary representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by “Rule 6”, based on the 5-celled von Neumann neighborhood.

  • A285524: a(n) is the value d<n/2 maximizing the expression d!*(d + 1)!*2^(n-2*d-1)*stirling2(n-d, d+1), for n>=4.

  • A285526: Terms of A285524 that mark the beginning of four consecutive equal values.

  • A285542: Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by “Rule 35”, based on the 5-celled von Neumann neighborhood.

  • A285543: Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by “Rule 35”, based on the 5-celled von Neumann neighborhood.

  • A285612: Binary representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by “Rule 62”, based on the 5-celled von Neumann neighborhood.

  • A285679: Positions of 2 in A285677.

  • A285682: Positions of 1 in A285680.

  • A285683: Positions of 2 in A285680.

  • A285869: a(n) is the number of zeros of the Chebyshev S(n, x) polynomial in the open interval (-sqrt(2), +sqrt(2)).

  • A285872: a(n) is the number of zeros of the Chebyshev S(n, x) polynomial (A049310) in the open interval (-sqrt(3), +sqrt(3)).

  • A285934: Number of connected induced (non-null) subgraphs of the perfect binary tree of height n.

  • A285949: {0->01, 1->0}-transform of the Thue-Morse word A010060.

  • A285950: Positions of 0’s in A285949; complement of A285951.

  • A285951: Positions of 1’s in A285949; complement of A285950.

  • A285952: {0->1, 1->10}-transform of the Thue-Morse word A010060.

  • A285953: Positions of 0 in A285952; complement of A285954.

  • A285954: Positions of 1 in A285952; complement of A285953.

  • A285982: a(n) = n! (mod n + 3).

  • A285995: Number of arrangements of n circles in the affine plane such that at least two of the circles meet.