Summary of block A171
Sequences in block A171
Section titled “Sequences in block A171”-
A171005: a(n) = (n+1)*(n-1)!/2.
-
A171074: A115112 with initial term changed from 0 to 1.
-
A171088: To find 3 consecutive integers in the sequence, you have to take 4 consecutive terms, no more and no less.
-
A171089: a(n) = 2*(Lucas(n)^2 - (-1)^n).
-
A171129: a(n)=(n^4-n^3-n^2-n)/2.
-
A171141: Numbers that are congruent to {6,33} mod 41.
-
A171160: a(n) = a(n-1) + 2*a(n-2) with a(0)=3, a(1)=4.
-
A171163: Number of children at height n in a doubly logarithmic tree. Leaves are at height 0.
-
A171182: Period 6: repeat [0, 1, 1, 1, 0, 2].
-
A171218: a(n) = Sum_{k=0..n} A109613(k)*A005843(n-k).
-
A171220: a(n) = (2n + 1)*5^n.
-
A171231: a(n) = (10*2^n + 3 - (-1)^n)/6.
-
A171237: a(0)=2, a(1)=3, a(n) = 3 + a(n-1) + a(n-2) for n >= 2.
-
A171261: Numbers n such that prime(n)^n-n is prime.
-
A171270: a(n) is the only number m such that m = pi(1^(1/n)) + pi(2^(1/n)) + … + pi(m^(1/n)).
-
A171272: a(n) = 1 + 4*n*(1 + 2*n^2)/3.
-
A171372: a(n) = Numerator of 1/(2*n)^2 - 1/(3*n)^2 for n > 0, a(0) = 1.
-
A171375: 1+3*10^n+100^n.
-
A171381: Numbers k such that (3^k + 1)/2 is prime.
-
A171382: a(n) = (2*2^n+7*(-1)^n)/3.
-
A171386: The characteristic function of 2 and 3: 1 if n is prime such that either n-1 or n+1 is prime, else 0.
-
A171387: The characteristic function of primes > 3: 1 if n is prime such that neither prime+-1 is prime else 0.
-
A171389: a(n) = 21*2^n - 1.
-
A171390: a(n) = 37*2^(n-1)-1.
-
A171449: Powers of 2 (A000079) with 1 changed to -1.
-
A171451: a(n) = 2^C(n, 2) * 2^floor(n/3).
-
A171452: a(n) = C(n,2) + floor(n/3).
-
A171461: a(n) = 1 + 6*10^n + 100^n.
-
A171463: The natural numbers excluding 2 and 3.
-
A171472: a(n) = 6*a(n-1) - 8*a(n-2) for n > 1; a(0) = 7, a(1) = 30.
-
A171473: a(n) = 6*a(n-1) - 8*a(n-2)-3 for n > 1; a(0) = 35, a(1) = 135.
-
A171476: a(n) = 6*a(n-1) - 8*a(n-2) for n > 1, a(0)=1, a(1)=6.
-
A171477: a(n) = 6*a(n-1) - 8*a(n-2) + 1 for n > 1; a(0) = 1, a(1) = 7.
-
A171478: a(n) = 6*a(n-1) - 8*a(n-2) + 2 for n > 1; a(0) = 1, a(1) = 8.
-
A171479: a(n) = 6*a(n-1)-8*a(n-2)+3 for n > 1; a(0) = 1, a(1) = 8.
-
A171480: a(n) = 6*a(n-1) - 8*a(n-2) + 4 for n > 1; a(0) = 1, a(1) = 9.
-
A171494: a(n) = 2*a(n-1) for n > 1; a(0) = 6, a(1) = 16.
-
A171495: a(n) = 3*a(n-1)+4 for n > 0; a(0) = 6.
-
A171496: a(n) = 6*a(n-1) - 8*a(n-2) for n > 1; a(0) = 6, a(1) = 28.
-
A171497: a(n) = 2*a(n-1) for n > 1; a(0) = 3, a(1) = 8.
-
A171498: a(n) = 4*3^n-1.
-
A171499: a(n) = 6*a(n-1) - 8*a(n-2) for n > 1; a(0) = 3, a(1) = 14.
-
A171501: Inverse binomial transform of A084640.
-
A171507: a(n) = (5*2^(n+1)-9-(-1)^n)/6-2*n.
-
A171516: a(n) = a(n-1) + a(n-2) + k, n>1; with a(0) = 1, a(1) = 2, k = 3.
-
A171519: a(n) = numbers m such that are not the product of k-th noncomposite number and k for any k >= 1.
-
A171526: Denominator of (n-th noncomposite/n).
-
A171552: a(n) = 2^n*floor((5-2n)/3).
-
A171554: Numbers k such that 1 + 9*10^k + 100^k is prime.
-
A171556: a(n) = 3*C(n)-2, where C(n) = A000108(n).
-
A171559: Powers of 2 (cf. A000079) with 1 replaced by 3.
-
A171587: Sequence of the diagonal variant of the Fibonacci word fractal. Sequence of the Fibonacci tile.
-
A171590: a(n) = 1+4^(n+1)-4*(-2)^n.
-
A171604: Take the standard 2-D lattice packing of pennies; a(n) = number of ways to pick n pennies (modulo rotations and reflections) such that if we form a linkage with centers of pennies as hinges and with struts between centers of two touching pennies, the linkage is rigid.
-
A171621: Numerator of 1/4 - 1/n^2, each fourth term multiplied by 4.
-
A171623: a(n) = floor(n-th composite / n).
-
A171624: Floor(n-th nonprime / n).
-
A171627: a(n) = ceiling(n-th composite/n).
-
A171640: a(n) = 10*a(n-1)-a(n-2)-4 with a(1)=1 and a(2)=3.
-
A171647: a(1) = 1; for n > 1, a(n) = 2*a(n-1) if n is even, a(n) = ((n+1)/(n-1))*a(n-1) if n is odd.
-
A171654: Period 10: repeat 0, 1, 6, 7, 2, 3, 8, 9, 4, 5.
-
A171662: a(n) = floor((2*n^2 + n)/6).
-
A171708: Numbers k such that the k-th prime of the form 6*k-1 and the k-th prime of the form 6*k+1 are a pair of twin primes.
-
A171713: 2n-th twin prime such that the q-th prime of the form 6*k-1 and the q-th prime of the form 6*k+1 are the 2n-th and (2n+1)-st twin primes (A001097).
-
A171714: a(n) = ceiling((n+1)^4/2).
-
A171737: Number of new extreme inequalities for the flag f-vectors of graded posets of rank n that do not come from those of lower ranks.
-
A171739: a(n) = 2^(n*(n-1)/2)*3^(n*(n+1)/2).
-
A171753: Expansion of g.f. 1/(1-3*x-x^2/(1-3*x-x^2/(1-3*x))).
-
A171757: Even numbers whose binary expansion begins 10.
-
A171763: Odd numbers whose binary expansion begins 10.
-
A171769: Partial sums of A042964 (numbers congruent to 2 or 3 mod 4).
-
A171783: Third smallest divisor of smallest number having exactly n divisors.
-
A171809: Number of 5 X 5 permutation matrices such that the n-th matrix power is the identity matrix and the determinant is -1.
-
A171826: Nonnegative integers that can be made using exactly three threes (3 3’s) and the four basic operators {+, -, *, /}.
-
A171835: Partial sums of numbers congruent to {3, 4, 5, 6} mod 8 (A047425).
-
A171842: Binomial transform of 1,0,1,0,2,0,4,0,8,0,16,…
-
A171869: a(n) is the period of A175555(n) in the sequence {A175555}.
-
A171891: 1 and all numbers >= 10.
-
A171892: 0, 1 and all numbers >= 9.
-
A171905: a(1) = 1 and a(2) = 2, a(n) = |(sum of previous terms) - n|.
-
A171950: a(1)=1. a(n) = the absolute difference between (the sum of previous terms) and A000217(n-2), n>1.
-
A171959: a(1) = 0, for n >= 2; a(n) = the smallest number h such that tau(h) = A000005(h) = a(n-1) + 3.
-
A171960: Values of the 2-complement of n in ternary representation.
-
A171965: Partial sums of floor(n^2/6) (A056827).
-
A171970: Integer part of the height of an equilateral triangle with side length n.