Summary of block A083
Sequences in block A083
Section titled “Sequences in block A083”-
A083023: a(n) = number of partitions of n into a pair of parts n=p+q, p>=q>=0, with p-q equal to a square >= 0.
-
A083026: Numbers that are congruent to {0, 2, 4, 5, 7, 9, 11} mod 12.
-
A083027: Duplicate of A060107.
-
A083030: Numbers that are congruent to {0, 4, 7} mod 12.
-
A083031: Numbers that are congruent to {0, 3, 7} mod 12.
-
A083034: Numbers that are congruent to {0, 1, 3, 5, 7, 8, 10} mod 12.
-
A083035: a(n) = floor(sqrt(2)*n)-2*floor(n/sqrt(2)).
-
A083039: Number of divisors of n that are <= 3.
-
A083040: Number of divisors of n that are <= 4.
-
A083043: Integers y such that 11*x^2 - 9*y^2 = 2 for some integer x.
-
A083045: Main diagonal of table A083044.
-
A083051: First column of table A083050.
-
A083058: Number of eigenvalues equal to 1 of n X n matrix A(i,j)=1 if j=1 or i divides j.
-
A083062: a(n) = (n+1)^n/(n+2) - (-1)^n/(n+2).
-
A083063: a(n) = (n+1)^(n-1)/(n+2) + (-1)^n/(n+2).
-
A083065: 4th row of number array A083064.
-
A083066: 5th row of number array A083064.
-
A083067: 6th row of number array A083064.
-
A083068: 7th row of number array A083064.
-
A083069: Main diagonal of number array A083064.
-
A083070: First superdiagonal of number array A083064.
-
A083071: First subdiagonal of number array A083064.
-
A083072: A subdiagonal of number array A083064.
-
A083073: A subdiagonal of number array A083064.
-
A083074: a(n) = n^3 - n^2 - n - 1.
-
A083076: Third row of number array A083075.
-
A083077: Fifth row of number array A083075.
-
A083078: 6th row of number array A083075.
-
A083079: 4th column of number array A083075.
-
A083085: a(n) = (2+(-5)^n)/3.
-
A083086: a(n) = (2^(n+1) + (-4)^n)/3.
-
A083088: First column of table A083087.
-
A083089: Numbers that are congruent to {0, 2, 4, 6, 7, 9, 11} mod 12.
-
A083098: a(n) = 2*a(n-1) + 6*a(n-2).
-
A083099: a(n) = 2*a(n-1) + 6*a(n-2), a(0) = 0, a(1) = 1.
-
A083100: a(n) = 2*a(n-1) + 7*a(n-2).
-
A083101: a(n) = 2*a(n-1) + 10*a(n-2), with a(0) = 1, a(1) = 12.
-
A083102: a(n) = 2*a(n-1) + 10*a(n-2), with a(0) = 1, a(1) = 2.
-
A083120: Numbers that are congruent to {0, 2, 4, 5, 7, 9, 10} mod 12.
-
A083127: a(n) = 3*n^3 + n^2 - 4*n.
-
A083132: Number the letters of English alphabet from 1 to 26; sequence specifies capital letters with up-down symmetry.
-
A083133: Number the letters of English alphabet from 1 to 26; sequence specifies capital letters with no symmetry.
-
A083196: a(n) = 8*n^4 + 9*n^2 + 2.
-
A083217: a(n) = (2*5^n + (-1)^n)/3.
-
A083219: a(n) = n - 2*floor(n/4).
-
A083220: a(n) = n + (n mod 4).
-
A083223: a(n) = (5*6^n+(-6)^n)/6.
-
A083225: a(n) = (7*8^n + (-8)^n)/8.
-
A083228: A Jacobsthal related sequence.
-
A083229: a(n) = (3*3^n + (-5)^n)/4.
-
A083230: Number of repunit divisors of n.
-
A083231: a(n) = (3*5^n + (-3)^n)/4.
-
A083232: a(n) = (3*7^n+(-1)^n)/4.
-
A083233: a(n) = (3*8^n + 0^n)/4.
-
A083234: a(n) = (3*10^n + 2^n)/4.
-
A083277: k appears 3k-2 times.
-
A083282: a(n) = n^(3*n).
-
A083294: a(n) = (4 + (-9)^n)/5.
-
A083295: a(n) = (4*2^n + (-8)^n)/5.
-
A083297: a(n) = (4*4^n + (-6)^n)/5.
-
A083299: a(n) = (4*6^n + (-4)^n)/5.
-
A083300: a(n) = (4*7^n + (-3)^n)/5.
-
A083301: a(n) = (4*8^n + (-2)^n)/5.
-
A083302: a(n) = (4*9^n + (-1)^n)/5.
-
A083313: a(0)=1; a(n) = 3^n - 2^(n-1) for n >= 1.
-
A083314: (2*4^n-(3^n-1))/2.
-
A083315: a(n) = (2*5^n-(4^n-2^n))/2.
-
A083316: a(n) = (2*6^n - (5^n - 3^n))/2.
-
A083318: a(0) = 1; for n>0, a(n) = 2^n + 1.
-
A083319: 4^n+3^n-2^n.
-
A083320: a(n) = 5^n + 4^n - 3^n.
-
A083321: a(n) = (-1)^n + (-2)^n - (-3)^n.
-
A083323: a(n) = 3^n - 2^n + 1.
-
A083324: a(n) = 4^n - 3^n + 2^n.
-
A083325: a(n) = 5^n - 4^n + 3^n.
-
A083326: a(n) = 6^n - 5^n + 4^n.
-
A083327: a(n) = (5^n - 4^n + 3^n - 2^n)/2.
-
A083329: a(0) = 1; for n > 0, a(n) = 3*2^(n-1) - 1.
-
A083330: a(n) = (3*4^n - 2*3^n + 2^n)/2.
-
A083332: a(n) = 10*a(n-2) - 16*a(n-4) for n > 3, a(0) = 1, a(1) = 5, a(2) = 14, a(3) = 34.
-
A083333: a(n) = 10*a(n-2) - 16*a(n-4) for n>=4, with a(0)=a(1)=1, a(2)=6, a(3)=10.
-
A083336: a(n) = 4*a(n-2) - a(n-4).
-
A083337: a(n) = 2*a(n-1) + 2*a(n-2); a(0)=0, a(1)=3.
-
A083364: Antidiagonal sums of table A083362.
-
A083374: a(n) = n^2 * (n^2 - 1)/2.
-
A083392: Alternating partial sums of A000217.
-
A083400: Numbers n such that A053664(n) and A073605(n) are primes.
-
A083420: a(n) = 2*4^n - 1.
-
A083421: a(n)=2*5^n-2^n.
-
A083423: a(n) = (5*3^n + (-3)^n)/6.
-
A083424: a(n) = (5*4^n + (-2)^n)/6.
-
A083425: a(n) = (5*5^n + (-1)^n)/6.
-
A083426: a(n) = (4*7^n+2^n)/5.
-
A083436: Smallest palindrome which is 1 more than the product of n consecutive numbers.
-
A083445: Largest n-digit number minus the product of its digits; i.e., a(n) = 99999… (n 9’s) - 9^n.
-
A083462: Smallest palindrome k such that k - n is a distinct power of 2, i.e., a power of 2 that has not arisen earlier.
-
A083505: Erroneous version of A027428.
-
A083528: a(n) = 5^n mod 2*n.
-
A083529: a(n) = 5^n mod 3*n.
-
A083530: a(n) = 7^n mod (2*n).
-
A083564: a(n) = L(n)*L(2n), where L(n) are the Lucas numbers (A000204).
-
A083570: A de Bruijn sequence of length 9 over {0, 1, 2}, repeated.
-
A083571: Numbers k such that A008509(k) is prime.
-
A083575: a(0) = 6; for n>0, a(n) = 2*a(n-1) - 1.
-
A083578: a(n) = (6^n + (-4)^n)/2.
-
A083579: Generalized Jacobsthal numbers.
-
A083581: a(n) = 8/3 - 5*(-2)^n/3.
-
A083582: a(n) = (8*2^n-5*(-1)^n)/3.
-
A083583: a(n) = (8*3^n - 5*0^n)/3.
-
A083584: a(n) = (8*4^n - 5)/3.
-
A083585: (8*5^n - 5*2^n)/3.
-
A083594: a(n) = (7 - 4*(-2)^n)/3.
-
A083595: a(n) = (7*2^n - 4(-1)^n)/3.
-
A083596: Duplicate of A082541.
-
A083597: a(n) = (7*4^n - 4)/3.
-
A083652: Sum of lengths of binary expansions of 0 through n.
-
A083658: a(n) = a(n-1) + a(n-2) + gcd(a(n-1), a(n-2)) for n > 1; a(0)=1, a(1)=1.
-
A083667: Number of antisymmetric binary relations on a set of n labeled points.
-
A083683: a(n) = 11*2^n + 1.
-
A083686: a(0) = 8; for n>0, a(n) = 2*a(n-1) - 1.
-
A083694: a(n) = 2*A002532(n).
-
A083695: a(n) = 2*a(n-1) + 5*a(n-2), with a(0) = 0, a(1) = 3.
-
A083696: a(n) = Sum_{r=0..2^(n-1)} (5^r/(2r)!)*Product_{k=0..2r-1} (2^n - k).
-
A083697: a(n) = 2^(2^n - 1) * Fibonacci(2^n).
-
A083705: a(n) = 2*a(n-1) - 1 with a(0) = 10.
-
A083706: a(n) = 2^(n+1) + n - 1.
-
A083713: a(n) = (8^n - 1)*3/7.
-
A083727: a(n) = n * (2^n - 8).
-
A083783: Diagonal of A083782.
-
A083811: Numbers n such that 2n+1 is the digit reversal of n+1.
-
A083812: 4n-1 is the digit reversal of n-1.
-
A083813: a(n) = 3*(10^n-1).
-
A083818: Numbers k such that 2k-1 is the digit reversal of k.
-
A083858: Expansion of x/(1 - 3*x - 6*x^2).
-
A083877: Absolute value of determinant of n X n matrix where the element a(i,j) = if i + j > n then 2*(i + j -n) - 1, else 2*(n + 1 - i - j).
-
A083878: a(0)=1, a(1)=3, a(n) = 6*a(n-1) - 7*a(n-2), n >= 2.
-
A083879: a(0)=1, a(1)=4, a(n) = 8*a(n-1) - 14*a(n-2), n >= 2.
-
A083880: a(0)=1, a(1)=5, a(n) = 10*a(n-1) - 23*a(n-2), n >= 2.
-
A083881: a(n) = 6*a(n-1) - 6*a(n-2), with a(0)=1, a(1)=3.
-
A083882: a(0)=1, a(1)=4, a(n)=8a(n-1)-13a(n-2), n>=2.
-
A083884: a(n) = (3^(2*n) + 1) / 2.
-
A083885: (4^n+2^n+0^n+(-2)^n)/4.
-
A083909: Numbers of the form 10^(m-k)*(10^(m+k+1)-10^k), m, k >= 0.
-
A083920: Number of nontriangular numbers <= n.
-
A083943: A generalized Jacobsthal sequence.
-
A083944: A generalized Jacobsthal sequence.