Skip to content

Summary of block A229

47 sequences
  • A229004: Indices of Bell numbers divisible by 3.

  • A229013: Number of arrays of median of three adjacent elements of some length-5 0..n array, with no adjacent equal elements in the latter.

  • A229039: G.f.: Sum_{n>=0} (n+2)^n * x^n / (1 + (n+2)*x)^n.

  • A229135: n * (2 + 2^(2*n - 1)).

  • A229136: Number of solutions to Sum_{i=1..n} x_i^2 == 1 (mod 4) with x_i in 0..3.

  • A229144: Partial sums of (Fibonacci numbers mod 3).

  • A229146: a(n) = n^3*(5*n+3)/2.

  • A229147: a(n) = n^4*(3*n+2).

  • A229149: a(n) = n^6*(4*n+3).

  • A229150: a(n) = n^7*(9*n+7)/2.

  • A229151: a(n) = n^8*(5*n+4).

  • A229183: a(n) = n*(n^2 + 3)/2.

  • A229220: a(n) = a(n-1)^2 + (-1)^n with a(1)=1.

  • A229231: Arises in complete classification of spherically symmetric static spacetimes via Noether symmetries.

  • A229277: Number of ascending runs in {1,…,3}^n.

  • A229278: Number of ascending runs in {1,…,4}^n.

  • A229279: Number of ascending runs in {1,…,5}^n.

  • A229354: Total sum of n-th powers of parts in all partitions of 3.

  • A229355: Total sum of n-th powers of parts in all partitions of 4.

  • A229384: Positive integer solutions y1, x1, y2, x2 to Ljunggren’s equation x^2 + 1 = 2y^4.

  • A229439: Number of n X 2 0..2 arrays with horizontal differences mod 3 never 1, vertical differences mod 3 never -1, and rows and columns lexicographically nondecreasing.

  • A229446: Number of 3 X n 0..2 arrays with horizontal differences mod 3 never 1, vertical differences mod 3 never -1, and rows and columns lexicographically nondecreasing.

  • A229462: Idoneal numbers (A000926) that are not pentagon exception numbers (A229461).

  • A229463: Expansion of g.f. 1/((1-x)^2*(1-26*x)).

  • A229472: Number of defective 4-colorings of an n X 1 0..3 array connected horizontally, antidiagonally and vertically with exactly one mistake, and colors introduced in row-major 0..3 order.

  • A229489: Conjecturally, possible differences between prime(k)^2 and the next prime for some k.

  • A229504: Number of defective 3-colorings of an n X 2 0..2 array connected diagonally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order.

  • A229554: a(n) = 7*n! + 1.

  • A229580: Number of defective 3-colorings of an n X 2 0..2 array connected horizontally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order.

  • A229581: Number of defective 3-colorings of an n X 3 0..2 array connected horizontally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order.

  • A229593: Number of boomerang patterns appearing in n X n coins, rotation not allowed.

  • A229598: Voids left when packing boomerangs into n X n coins.

  • A229611: Expansion of 1/((1-x)^3*(1-11x)).

  • A229718: Number of arrays of length 2 that are sums of n consecutive elements of length 2+n-1 permutations of 0..2+n-2, and no two consecutive rises or falls in the latter permutation.

  • A229788: 6*2^n - n^2 - 5*n - 6.

  • A229803: Domination number for rook graph HR(n) on a triangular board of hexagonal cells. The rook can move along any row of adjacent cells, in any of the three directions.

  • A229828: a(n) = 7*n! - 1.

  • A229831: Largest prime p such that some elliptic curve over an extension of the rationals of degree n has a point of finite order p.

  • A229838: Consider all primitive 60-degree triangles with sides A < B < C. The sequence gives the values of A.

  • A229850: Number of prime factors congruent to 1 mod 3 that divide the Fermat number 2^(2^n) + 1.

  • A229852: 3*h^2, where h is an odd integer not divisible by 3.

  • A229853: a(n) = 384*n + 1.

  • A229855: a(n) = 384*n + 257.

  • A229858: Consider all 120-degree triangles with sides A < B < C. The sequence gives the values of A.

  • A229878: Number of undirected circular permutations tau(1), …, tau((p_n-1)/2) of 1, …, (p_n-1)/2 such that the (p_n-1)/2 numbers tau(1)^2 + tau(2)^2, tau(2)^2 + tau(3)^2, …, tau((p_n-3)/2)^2 + tau((p_n-1)/2)^2, tau((p_n-1)/2)^2 + tau(1)^2 give all the (p_n-1)/2 quadratic residues modulo p_n, where p_n is the n-th prime.

  • A229912: a(n) = Fibonacci(n) * (2*Fibonacci(n) + 1).

  • A229975: The base 8 expansion of the number of trailing zeros of the base 8 expansion of (8^n)!.