Skip to content

Summary of block A028

91 sequences
  • A028230: Bisection of A001353. Indices of square numbers which are also octagonal.

  • A028231: From hexagons in a circle problem.

  • A028242: Follow n+1 by n. Also (essentially) Molien series of 2-dimensional quaternion group Q_8.

  • A028243: a(n) = 3^(n-1) - 2^n + 1 (essentially Stirling numbers of second kind).

  • A028250: Sequence arising in multiprocessor page migration.

  • A028252: Sequence arising in multiprocessor page migration.

  • A028253: n mod Fibonacci(n).

  • A028293: Period 7.

  • A028300: a(1) = 1; thereafter a(n+1) = a(n)^2 + n.

  • A028310: Expansion of (1 - x + x^2) / (1 - x)^2 in powers of x.

  • A028329: Twice central binomial coefficients.

  • A028347: a(n) = n^2 - 4.

  • A028352: A Golomb-like recurrence that decreases infinitely often.

  • A028356: Simple periodic sequence underlying clock sequence A028354.

  • A028357: Partial sums of A028356.

  • A028361: Number of totally isotropic spaces of index n in orthogonal geometry of dimension 2n.

  • A028362: Total number of self-dual binary codes of length 2n. Totally isotropic spaces of index n in symplectic geometry of dimension 2n.

  • A028365: Order of general affine group over GF(2), AGL(n,2).

  • A028366: a(n) = (2^n - 1)!.

  • A028367: a(n) = (2^n-2)!.

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

  • A028370: a(n) = (2^(n-1))!*2^(2^(n-1)-1).

  • A028371: a(n) = (2^(n-1)-1)!*2^((2^(n-1)-1)-1).

  • A028387: a(n) = n + (n+1)^2.

  • A028391: a(n) = n - floor(sqrt(n)).

  • A028392: a(n) = n + floor(sqrt(n)).

  • A028399: a(n) = 2^n - 4.

  • A028400: a(n) = (2^n + 1)^2.

  • A028401: The (2^n+1)-th triangular number (cf. A000217).

  • A028402: Number of types of Boolean functions of n variables under a certain group.

  • A028403: Number of types of Boolean functions of n variables under a certain group.

  • A028429: Clog sequence in base 8. Right to left concatenation of n, int(log_8(n)),int(log_8(int(log_8(n)))),… in base8.

  • A028438: Golc sequence in base 8. Left to right concatenation of n,int(log_8(n)),int(log_8(int(log_8(n)))),… in base8.

  • A028477: Number of perfect matchings in graph C_{6} X P_{n}.

  • A028494: a(n) = -(1/2)*(n+2)*(n^2 - 6*n - 1).

  • A028497: Maximum number of facets of n-dimensional polytope with {0,1}-coordinates.

  • A028552: a(n) = n*(n+3).

  • A028557: a(n) = n*(n+5).

  • A028560: a(n) = n*(n + 6).

  • A028563: a(n) = n*(n+7).

  • A028566: a(n) = n*(n+8).

  • A028569: a(n) = n*(n + 9).

  • A028692: 23-factorial numbers.

  • A028693: 24-factorial numbers.

  • A028694: 25-factorial numbers.

  • A028722: Square classes of 2-adic rationals.

  • A028724: a(n) = (1/2)*floor(n/2)*floor((n-1)/2)*floor((n-2)/2).

  • A028726: Nonsquares mod 13.

  • A028727: Nonsquares mod 14.

  • A028728: Nonsquares mod 15.

  • A028729: Nonsquares mod 16.

  • A028730: Nonsquares mod 17.

  • A028731: Nonsquares mod 18.

  • A028732: Nonsquares mod 19.

  • A028733: Nonsquares mod 20.

  • A028734: Nonsquares mod 21.

  • A028735: Nonsquares mod 22.

  • A028737: Nonsquares mod 24.

  • A028738: Nonsquares mod 25.

  • A028739: Nonsquares mod 26.

  • A028740: Nonsquares mod 27.

  • A028743: Nonsquares mod 30.

  • A028744: Nonsquares mod 31.

  • A028747: Nonsquares mod 34.

  • A028762: Nonsquares mod 49.

  • A028814: Expansion of (1-2*x)/((1-x)^3*(1-4*x)).

  • A028835: Numbers whose iterated sum of digits is a prime.

  • A028836: Iterated sum of digits of n is a power of 2.

  • A028837: Iterated sum of digits of n is a square.

  • A028859: a(n+2) = 2*a(n+1) + 2*a(n); a(0) = 1, a(1) = 3.

  • A028860: a(n+2) = 2*a(n+1) + 2*a(n); a(0) = -1, a(1) = 1.

  • A028868: Primes that when squared give numbers with digits in nonascending order.

  • A028872: a(n) = n^2 - 3.

  • A028875: a(n) = n^2 - 5.

  • A028878: a(n) = (n+3)^2 - 6.

  • A028881: a(n) = n^2 - 7.

  • A028884: a(n) = (n + 3)^2 - 8.

  • A028892: a(n) = Fibonacci(n) - 2^(floor(n/2)).

  • A028895: 5 times triangular numbers: a(n) = 5*n*(n+1)/2.

  • A028896: 6 times triangular numbers: a(n) = 3*n*(n+1).

  • A028901: Map n = Sum c_i*10^i to a(n) = Sum c_i*6^i.

  • A028902: Map n = Sum c_i 10^i to a(n) = Sum c_i 7^i.

  • A028903: Map n = Sum c_i 10^i to a(n) = Sum c_i 8^i.

  • A028917: a(n) = (3*n+1)! / (24*n).

  • A028918: (3n+1)!/(4*(3n-1)).

  • A028919: Congruent to 0, 6, 10, 12 (mod 14).

  • A028946: Maximal cardinality of 2-distance set in R^n with distance ratio tau.

  • A028964: Numbers represented by quadratic form with Gram matrix [ 2, 1, 1; 1, 4, 2; 1, 2, 4 ], divided by 2.

  • A028991: Odd 9-gonal (or enneagonal) numbers.

  • A028993: Odd 10-gonal (or decagonal) numbers.

  • A028994: Even 10-gonal (or decagonal) numbers.