Skip to content

Summary of block A101

80 sequences
  • A101000: Period 3: repeat [0, 1, 3].

  • A101052: Number of preferential arrangements of n labeled elements when only k <= 3 ranks are allowed.

  • A101098: a(1)=1; thereafter, a(n+1) = 20*n^3 + 10*n.

  • A101101: a(1)=1, a(2)=5, and a(n)=6 for n >= 3.

  • A101103: Partial sums of A101104. First differences of A005914.

  • A101104: a(1)=1, a(2)=12, a(3)=23, and a(n)=24 for n>=4.

  • A101156: a(n) = 2*Fibonacci(n) + 8*Fibonacci(n-5).

  • A101165: a(n) = (7*n^3 + 6*n^2 + 5*n) / 6.

  • A101205: Second column of triangle in A101204.

  • A101206: Third column of triangle in A101204.

  • A101213: a(n) = n * (n+1)^2 * (n+2)^3.

  • A101265: a(1) = 1, a(2) = 2, a(3) = 6; a(n) = 5*a(n-1) - 5*a(n-2) + a(n-3) for n > 3.

  • A101272: a(n) = n, n <= 6; a(n) = 6, n > 6.

  • A101279: a(1) = 1; a(2k) = a(k), a(2k+1) = k.

  • A101292: a(n) = n! + Sum_{i=1..n} i.

  • A101293: a(n) = Lucas(n!).

  • A101305: Begin with 0 and at each successive iteration append the next power of 10.

  • A101327: 2^(2^(2^x-1)-1)-1 == M(M(M(x))).

  • A101328: Recurring numbers in the count of consecutive composite numbers between balanced primes and their lower or upper prime neighbors.

  • A101329: 2^(2^(2^x)+1)-1 = M(F(x)) == Mersenne(Fermat(x)).

  • A101331: Fermat(Mersenne(x)) = 2^(2^(2^x-1))+1.

  • A101338: Antidiagonal sums in A101321.

  • A101341: Fibonacci-Fermat numbers.

  • A101342: Fibonacci-Mersenne numbers.

  • A101345: a(n) = Knuth’s Fibonacci (or circle) product “2 o n”.

  • A101348: Arises from a particular cyclic transformation of the floretion - .5’i - .5i’ - .5’ij’ - .5’ik’ + .5’ji’ + .5’ki’.

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

  • A101352: Partial sums of A101351.

  • A101353: a(n) = Sum_{k=0..n} (2^k + Fibonacci(k)).

  • A101357: Duplicate of A004255.

  • A101361: a(1) = a(2) = 1; for n > 2, a(n) = Knuth’s Fibonacci (or circle) product “a(n-1) o a(n-2)”.

  • A101362: a(n) = (n+1)*n^4.

  • A101368: The sequence solves the following problem: find all the pairs (i,j) such that i divides 1+j+j^2 and j divides 1+i+i^2. In fact, the pairs (a(n),a(n+1)), n>0, are all the solutions.

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

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

  • A101376: a(n) = n^2*(n^3 - n^2 + n + 1)/2.

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

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

  • A101386: Expansion of g.f.: (5 - 3*x)/(1 - 6*x + x^2).

  • A101407: a(n) = 4^(n!).

  • A101423: Number of different cuboids with volume p^3 * q^n, where p,q are distinct prime numbers.

  • A101424: Number of different cuboids with volume p^4 * q^n, where p,q are distinct prime numbers.

  • A101425: Number of different cuboids with volume p^5 X q^n, where p,q are distinct prime numbers.

  • A101485: a(n) = (4n)! / ( 4^n * (2n)! ).

  • A101523: Indices of primes in sequence defined by A(0) = 67, A(n) = 10*A(n-1) - 43 for n > 0.

  • A101524: Indices of primes in sequence defined by A(0) = 69, A(n) = 10*A(n-1) - 61 for n > 0.

  • A101553: A modular recurrence.

  • A101600: Expansion of g.f. c(3x)^2, where c(x) is the g.f. of A000108.

  • A101604: a(n) = 2*a(n-1) + 5*a(n-2) + 2*a(n-3).

  • A101622: A Horadam-Jacobsthal sequence.

  • A101634: Subtract 1, multiply by 1, subtract 2, multiply by 2, etc.

  • A101642: a(n) = Knuth’s Fibonacci (or circle) product “3 o n”.

  • A101673: Fixed point of morphism 0 -> 01, 1 -> 20, 2 -> 20.

  • A101675: Expansion of (1 - x - x^2)/(1 + x^2 + x^4).

  • A101676: a(n) = a(n-1) - a(n-2) + a(n-3) - a(n-4) + a(n-5) with initial terms 1,0,-2,-1,0.

  • A101677: a(n) = a(n-1) - 2*a(n-2) + 2*a(n-3) - 2*a(n-4) + 2*a(n-5) - a(n-6).

  • A101686: a(n) = Product_{i=1..n} (i^2 + 1).

  • A101688: Once 1, once 0, repeat, twice 1, twice 0, repeat, thrice 1, thrice 0, … and so on.

  • A101694: A101693(2^n).

  • A101714: Indices of primes in sequence defined by A(0) = 47, A(n) = 10*A(n-1) - 63 for n > 0.

  • A101734: Indices of primes in sequence defined by A(0) = 41, A(n) = 10*A(n-1) + 71 for n > 0.

  • A101741: 4th row of A101646.

  • A101776: Smallest k such that k^2 is equal to the sum of n not-necessarily-distinct primes plus 1.

  • A101803: Nearest integer to n*(phi-1), where phi is golden ratio 1.618033988749895… (A001622).

  • A101825: G.f.: x*(1+x)^2/(1-x^3).

  • A101830: Indices of primes in sequence defined by A(0) = 37, A(n) = 10*A(n-1) - 43 for n > 0.

  • A101853: a(n) = n*(20 + 15*n + n^2)/6.

  • A101864: Wythoff BB numbers.

  • A101865: Third row of A101858.

  • A101868: a(n) = n + 2*ceiling(phi*n), where phi = (1 + sqrt(5))/2. Row 1 of A101866.

  • A101869: Row 2 of A101866.

  • A101879: a(0) = 1, a(1) = 1, a(2) = 2; for n > 2, a(n) = 5*a(n-1) - 5*a(n-2) + a(n-3).

  • A101881: Write two numbers, skip one, write two, skip two, write two, skip three … and so on.

  • A101882: Write three numbers, skip one, write three, skip two, write three, skip three… and so on.

  • A101883: Write four numbers, skip one, write four, skip two, write four, skip three… and so on.

  • A101925: a(n) = A005187(n) + 1.

  • A101926: a(n) = 2^A101925(n).

  • A101945: a(n) = 6*2^n - n - 5.

  • A101946: a(n) = 6*2^n - 3*n - 5.

  • A101986: Maximum sum of products of successive pairs in a permutation of order n+1.