Summary of block A165
Sequences in block A165
Section titled “Sequences in block A165”-
A165020: Length of cycle mentioned in A165019.
-
A165024: Length of cycle mentioned in A165023.
-
A165130: a(n) = (2^(n+4)-1)*(2^n-1).
-
A165132: Primes whose logarithms are known to possess ternary BBP formulas.
-
A165133: a(n) = (2^(n+4)-1)*(2^n+1).
-
A165147: a(n) = (3*7^n-3^n)/2.
-
A165148: a(n) = (3*8^n-4^n)/2.
-
A165149: a(n) = (3*9^n - 5^n)/2.
-
A165150: a(n) = (3*10^n - 6^n)/2.
-
A165152: a(n) = (3*12^n - 8^n)/2.
-
A165157: Zero followed by partial sums of A133622.
-
A165164: Smallest k such that no set of n lattice points gives visibility to every point of a square k X k lattice.
-
A165187: a(n) = n^3*(n+1)^2*(n+2)/12.
-
A165190: G.f.: 1/((1-x^4)*(1-x^5)).
-
A165202: Expansion of (1+x)/(1 - x + x^2)^2.
-
A165205: a(n) = C(2n-1,n) + C(2n+1,n+1) - C(0,n).
-
A165207: Period 4: repeat [2, 2, 4, 4].
-
A165211: Period 8: repeat [0,1,0,1,1,0,1,0].
-
A165220: Numbers n such that 8*n+1 is a cube.
-
A165222: a(n) = (2^(n+4)+1)*(2^n+1).
-
A165224: a(0)=1, a(1)=9, a(n) = 18*a(n-1) - 49*a(n-2) for n > 1.
-
A165225: a(0)=1, a(1)=5, a(n) = 10*a(n-1) - 5*a(n-2) for n > 1.
-
A165229: a(n) = 12*a(n-1) - 6*a(n-2), with a(0)=1, a(1)=6.
-
A165230: a(0)=1, a(1)=7, a(n)=14*a(n-1)-7*a(n-2) for n>1 .
-
A165231: a(0)=1, a(1)=8, a(n)=16*a(n-1)-8*a(n-2) for n>1 .
-
A165232: a(0)=1, a(1)=9, a(n) = 18*a(n-1) - 9*a(n-2) for n>1.
-
A165233: Signed denominators of terms in series expansion of cos(x)+sin(x).
-
A165246: a(n) = (10^n + 53)/9.
-
A165247: a(n) = (10^n + 71)/9.
-
A165254: a(n) = 9 + n^17.
-
A165263: A sequence similar to the Fibonacci rabbit sequence for the Padovan sequence.
-
A165283: a(n) = (2*n + 1)*16^n.
-
A165310: a(0)=1, a(1)=3, a(n) = 7*a(n-1) - 9*a(n-2) for n > 1.
-
A165311: a(0)=1, a(1)=4, a(n)=9*a(n-1)-16*a(n-2) for n>1.
-
A165312: a(0)=1, a(1)=5, a(n)=11*a(n-1)-25*a(n-2) for n>1.
-
A165314: a(0)=1, a(1)=6, a(n)=13*a(n-1)-36*a(n-2) for n>1.
-
A165322: a(0)=1, a(1)=7, a(n)=15*a(n-1)-49*a(n-2) for n>1.
-
A165323: a(0)=1, a(1)=8, a(n)=17*a(n-1)-64*a(n-2) for n>1.
-
A165324: a(0)=1, a(1)=9, a(n)= 19*a(n-1)-81*a(n-2) for n>1.
-
A165326: a(0)=a(1)=1, a(n) = -a(n-1) for n > 1.
-
A165327: E.g.f: Sum_{n>=0} 2^(n(n-1)) * exp(2^n*x) * x^n/n!.
-
A165351: Numerator of 3*n/2.
-
A165355: a(n) = 3n + 1 if n is even, or a(n) = (3n + 1)/2 if n is odd.
-
A165367: Trisection a(n) = A026741(3n + 2).
-
A165394: Number of slanted 2 X n (i=1..2) X (j=i..n+i-1) 1..4 arrays with all 1s connected, all 2s connected, all 3s connected, all 4s connected, 1 in the upper left corner, 2 in the upper right corner, 3 in the lower left corner, 4 in the lower right corner, and with no element having more than 3 neighbors with the same value.
-
A165402: a(n) = (2*10^n - 11)/9.
-
A165405: a(0)=1, a(1)=3,a(n)=6*a(n-2)-a(n-1).
-
A165420: a(1) = 1, a(2) = 2, a(n) = product of the previous terms for n >= 3.
-
A165421: a(1) = 1, a(2) = 3, a(n) = product of the previous terms for n >= 3.
-
A165422: a(1) = 1, a(2) = 4, a(n) = product of the previous terms for n >= 3.
-
A165426: a(1) = 1, a(2) = 8, a(n) = product of the previous terms for n >= 3.
-
A165442: Start with m, repeatedly find sum of prime factors until we reach a fixed point, then compute sum of numbers in trajectory except for m and the fixed point. If the resulting sum equals m, adjoin m to the sequence.
-
A165457: a(n) = (2*n+1)!*(2*n+3)/3.
-
A165458: a(0)=1, a(1)=4, a(n) = 12*a(n-2) - a(n-1).
-
A165478: Positions of zeros in A165477.
-
A165498: Maximum length of arithmetic progression with difference n such that each term k has tau(k) = n.
-
A165518: Perfect squares (A000290) that can be expressed as the sum of four consecutive triangular numbers (A000217).
-
A165553: a(n) = (3/2)*(1+(-3)^(n-1)).
-
A165556: A symmetric version of the Josephus problem read modulo 2.
-
A165563: a(n) = 1 + 2*n + n^2 + 2*n^3 + n^4.
-
A165568: a(n) = -1 - 2*n + n^2 + 2*n^3 + n^4.
-
A165618: a(n) = binomial(n+8,8) - 1.
-
A165622: a(n)=(-4)*a(n-1)+8 with a(0)=1.
-
A165623: Integers of the form a(n)=2^n/n^2.
-
A165625: a(n)=(5/3)*(1+2*(-5)^(n-1)).
-
A165638: a(n)=(6/7)*(2+5*(-6)^(n-1)).
-
A165639: a(n)=(7/4)*(1+3*(-7)^(n-1)).
-
A165644: Number of ways to assemble an n-simplex from n+1 labeled (n-1)-simplices with labeled vertices, where left-handed and right-handed counterparts are considered distinct.
-
A165662: Period 5: repeat 4,4,8,6,8.
-
A165665: a(n) = (3*2^n - 2) * 2^n.
-
A165676: Fourth right hand column of triangle A165674.
-
A165717: Integers of the form k*(5+k)/4.
-
A165718: Integers of the form k*(k+7)/6.
-
A165734: Period 2: repeat 6,30.
-
A165735: Surviving integers under the double-count Josephus problem (see A054995), modulo 3.
-
A165746: a(n) = 3 - 2*3^n.
-
A165747: a(n) = 1-2n.
-
A165748: a(n) = (8/9)*(2+7*(-8)^(n-1)).
-
A165749: a(n) = (9/5)*(1+4*(-9)^(n-1)).
-
A165750: a(n) = (10/11)*(2+9*(-10)^(n-1)).
-
A165751: a(n) = 4 - 3*2^n.
-
A165752: a(n) = (8-5*4^n)/3.
-
A165754: a(n) = nimsum(n+(n+1)+(n+2)).
-
A165755: a(n) = (5-3*5^n)/2.
-
A165758: a(n) = (12-7*6^n)/5.
-
A165759: a(n) = (7-4*7^n)/3.
-
A165760: a(n) = (16-9*8^n)/7.
-
A165792: a(0)=1, a(n) = n*(a(n-1)+2).
-
A165793: a(0)=1, a(n)=n*(a(n-1)-2).
-
A165798: a(n) = 65*n^2.
-
A165800: Powers of 50.
-
A165802: Primes p with f(p), f(f(p)), … all prime, where f(n) = (n-1)/2. Stop when f(…f(p)…) is less than 4.
-
A165806: a(n) = 15n^2 + 3n + 1.
-
A165813: a(n) = n*(a(n-1)+3), a(0)=1.
-
A165814: a(n)=n*(a(n-1)-3), a(0)=1.
-
A165817: Number of compositions (= ordered integer partitions) of n into 2n parts.
-
A165897: a(n) = a(n-1) + largest proper divisor of a(n-1), a(1)=4.
-
A165900: a(n) = n^2 - n - 1.
-
A165907: Minimal m for packing the first n primes in a prime(n) X m rectangle.
-
A165928: a(n) = 2^(n^2)*(2^(2n+1)/3 + 1/3).
-
A165938: a(n) = A002203(n^2) for n>=1.
-
A165958: The digits on a number pad from lower right to upper left.
-
A165988: First trisection of A022998.
-
A165998: Denominators of Taylor series expansion of 1/(3*x)*log((1+x)/(1-x)^2).