Summary of block A088
Sequences in block A088
Section titled “Sequences in block A088”-
A088013: Binomial transform of A001541 (with interpolated zeros).
-
A088014: Expansion of e.g.f.: cosh(sqrt(2)*x)*(1+exp(x)).
-
A088015: Expansion of e.g.f. cosh(sqrt(2)*x) + exp(x)*(cosh(sqrt(2)*x) - 1).
-
A088020: a(n) = (n^2)!.
-
A088021: a(n) = (n^2)!/(n!)^2.
-
A088041: Smallest k such that k^4 - 1 is divisible by an n-th power, k > 1.
-
A088058: Duplicate of A062392.
-
A088059: Duplicate of A028387.
-
A088110: Numbers n such that 2^n + n and 2^n - n are noncomposite.
-
A088137: Generalized Gaussian Fibonacci integers.
-
A088138: Generalized Gaussian Fibonacci integers.
-
A088139: a(n) = 2*a(n-1) - 6*a(n-2), a(0)=0, a(1)=1.
-
A088140: Duplicate of A005451 (for n >= 3).
-
A088150: Value of n-th digit (counting from the right) in binary representation of n^n.
-
A088151: Value of n-th digit in ternary representation of n^n.
-
A088209: Numerators of convergents of the continued fraction with the n+1 partial quotients: [1;1,1,…(n 1’s)…,1,n+1], starting with [1], [1;2], [1;1,3], [1;1,1,4], …
-
A088210: Numerators of convergents of the continued fraction with the n+1 partial quotients: [2;2,2,…(n 2’s)…,2,n+1], starting with [1], [2;2], [2;2,3], [2;2,2,4], …
-
A088211: Denominators of convergents of the continued fraction with the n+1 partial quotients: [2;2,2,…(n 2’s)…,2,n+1], starting with [1], [2;2], [2;2,3], [2;2,2,4], …
-
A088218: Total number of leaves in all rooted ordered trees with n edges.
-
A088225: Solutions to x^n == 7 (mod 11).
-
A088227: Solutions x to x^n == 7 mod 13.
-
A088256: Primorial numbers k such that both k-1 and k+1 are prime.
-
A088305: a(0) = 1, a(n) = Fibonacci(2*n). It has the property that a(n) = 1*a(n-1) + 2*a(n-2) + 3*a(n-3) + 4*a(n-4) + …
-
A088317: a(n) = 8*a(n-1) + a(n-2), starting with a(0) = 1 and a(1) = 4.
-
A088320: a(n) = 10*a(n-1) + a(n-2), starting with a(0) = 1 and a(1) = 5.
-
A088321: Duplicate of A061301.
-
A088333: A version of Josephus problem: a(n) is the surviving integer under the following elimination process. Arrange 1,2,3,…,n in a circle, increasing clockwise. Starting with i=1, delete the integer 3 places clockwise from i. Repeat, counting 3 places from the next undeleted integer, until only one integer remains.
-
A088334: Expansion of 1/phi (phi being the golden ratio) as an infinite product: 1/phi = Product_{k=0..n} (1-1/a(k)).
-
A088386: a(n) = 2^n*(n!)^3.
-
A088414: A088260 indexed by A002110.
-
A088439: a(3n) = 3n, otherwise a(n) = 1.
-
A088440: a(4n) = 4n, otherwise a(n) = 1.
-
A088475: Numbers n such that the lunar sum of the distinct lunar prime divisors of n is >= n.
-
A088476: Numbers n such that the lunar sum of the distinct lunar prime divisors of n is > n.
-
A088480: Numbers n such that the lunar product of the distinct lunar prime divisors of n is >= n.
-
A088481: Numbers n such that the lunar product of the distinct lunar prime divisors of n is > n.
-
A088556: Numbers of the form (4^n + 4^(n-1) + … + 1) + (n mod 2).
-
A088578: a(n) = n*x^n + (n-1)*x^(n-1) + … + x + 1 for x=2.
-
A088581: a(n) = n*x^n + (n-1)*x^(n-1) + … + x + 1 for x=3.
-
A088582: a(n) = n*x^n + (n-1)*x^(n-1) + … + x + 1 for x=4.
-
A088645: a(n) = A088644(n)/n!.
-
A088650: a(n) is the smallest x such that A020498(k) + x is prime for all k = 1 to n.
-
A088666: a(n) = (n^4 + 1) mod 10.
-
A088668: Number of n X n matrices over GF(2) with characteristic polynomial x^(n-1) * (x-1).
-
A088671: Number of n X n matrices over GF(3) with characteristic polynomial x^(n-1) * (x-1).
-
A088679: a(n) = a(n-1)^2 * n / (n-1), n>1, a(0) = 0, a(1) = 1.
-
A088689: Jacobsthal numbers modulo 3.
-
A088741: Number of connected strongly regular simple graphs on n nodes.
-
A088795: a(n) = -1/16-3*n^2/8+17*n/12+n^3/12+(-1)^n/16.
-
A088828: Nonsquare positive odd numbers.
-
A088852: Number of n X n matrices over GF(4) with characteristic polynomial x^(n-1) * (x-1).
-
A088853: Number of n X n matrices over GF(5) with characteristic polynomial x^(n-1) * (x-1).
-
A088859: a(n) = L(n) + 2^n where L(n) = A000032(n) (the Lucas numbers).
-
A088911: Period 6: repeat [1, 1, 1, 0, 0, 0].
-
A088920: Solutions k to the Diophantine equation k = 2n^2 = m^2+1.
-
A088921: The number of 321- and 2143-avoiding permutations of length n.
-
A088938: Occurrences of 2’s in A088936.
-
A088981: a(n+2) = a(n+1) + a(n) - (2*n + 1) where a(0)=7, a(1)=11.