Summary of block A024
Sequences in block A024
Section titled “Sequences in block A024”-
A024000: a(n) = 1 - n.
-
A024001: a(n) = 1 - n^3.
-
A024002: a(n) = 1 - n^4.
-
A024003: a(n) = 1 - n^5.
-
A024004: a(n) = 1 - n^6.
-
A024005: a(n) = 1 - n^7.
-
A024006: a(n) = 1 - n^8.
-
A024007: a(n) = 1 - n^9.
-
A024008: a(n) = 1 - n^10.
-
A024009: a(n) = 1 - n^11.
-
A024010: a(n) = 1 - n^12.
-
A024012: a(n) = 2^n - n^2.
-
A024013: 2^n-n^3.
-
A024014: 2^n-n^4.
-
A024015: 2^n-n^5.
-
A024016: 2^n-n^6.
-
A024017: a(n) = 2^n - n^7.
-
A024018: 2^n-n^8.
-
A024019: 2^n-n^9.
-
A024020: a(n) = 2^n - n^10.
-
A024021: 2^n-n^11.
-
A024022: a(n) = 2^n - n^12.
-
A024023: a(n) = 3^n - 1.
-
A024024: a(n) = 3^n - n.
-
A024025: a(n) = 3^n - n^2.
-
A024026: a(n) = 3^n - n^3.
-
A024027: a(n) = 3^n - n^4.
-
A024028: a(n) = 3^n - n^5.
-
A024029: a(n) = 3^n-n^6.
-
A024030: a(n) = 3^n - n^7.
-
A024031: a(n) = 3^n - n^8.
-
A024032: a(n) = 3^n - n^9.
-
A024033: a(n) = 3^n - n^10.
-
A024034: a(n) = 3^n - n^11.
-
A024035: a(n) = 3^n - n^12.
-
A024036: a(n) = 4^n - 1.
-
A024037: a(n) = 4^n - n.
-
A024038: a(n) = 4^n - n^2.
-
A024039: a(n) = 4^n - n^3.
-
A024040: a(n) = 4^n - n^4.
-
A024041: a(n) = 4^n - n^5.
-
A024042: a(n) = 4^n - n^6.
-
A024043: a(n) = 4^n - n^7.
-
A024044: a(n) = 4^n - n^8.
-
A024045: a(n) = 4^n-n^9.
-
A024046: a(n) = 4^n - n^10.
-
A024047: a(n) = 4^n - n^11.
-
A024048: a(n) = 4^n - n^12.
-
A024049: a(n) = 5^n - 1.
-
A024050: a(n) = 5^n - n.
-
A024051: a(n) = 5^n - n^2.
-
A024052: a(n) = 5^n - n^3.
-
A024053: a(n) = 5^n - n^4.
-
A024054: a(n) = 5^n - n^5.
-
A024055: a(n) = 5^n - n^6.
-
A024056: a(n) = 5^n - n^7.
-
A024057: a(n) = 5^n - n^8.
-
A024058: a(n) = 5^n - n^9.
-
A024059: a(n) = 5^n - n^10.
-
A024060: a(n) = 5^n - n^11.
-
A024061: a(n) = 5^n - n^12.
-
A024062: a(n) = 6^n - 1.
-
A024063: a(n) = 6^n - n.
-
A024064: a(n) = 6^n - n^2.
-
A024065: a(n) = 6^n - n^3.
-
A024066: a(n) = 6^n - n^4.
-
A024067: a(n) = 6^n - n^5.
-
A024068: a(n) = 6^n - n^6.
-
A024069: a(n) = 6^n - n^7.
-
A024070: a(n) = 6^n-n^8.
-
A024071: a(n) = 6^n - n^9.
-
A024072: a(n) = 6^n - n^10.
-
A024073: a(n) = 6^n - n^11.
-
A024074: a(n) = 6^n - n^12.
-
A024075: a(n) = 7^n-1.
-
A024076: a(n) = 7^n - n.
-
A024077: a(n) = 7^n - n^2.
-
A024078: a(n) = 7^n - n^3.
-
A024079: a(n) = 7^n - n^4.
-
A024080: a(n) = 7^n - n^5.
-
A024081: a(n) = 7^n - n^6.
-
A024082: 7^n-n^7.
-
A024083: a(n) = 7^n - n^8.
-
A024084: a(n) = 7^n - n^9.
-
A024085: a(n) = 7^n - n^10.
-
A024086: a(n) = 7^n - n^11.
-
A024087: a(n) = 7^n - n^12.
-
A024088: a(n) = 8^n - 1.
-
A024089: a(n) = 8^n - n.
-
A024090: 8^n-n^2.
-
A024091: a(n) = 8^n - n^3.
-
A024092: a(n) = 8^n - n^4.
-
A024093: a(n) = 8^n - n^5.
-
A024094: 8^n-n^6.
-
A024095: a(n) = 8^n - n^7.
-
A024096: a(n) = 8^n - n^8.
-
A024097: a(n) = 8^n - n^9.
-
A024098: a(n) = 8^n - n^10.
-
A024099: a(n) = 8^n - n^11.
-
A024100: a(n) = 8^n - n^12.
-
A024101: a(n) = 9^n-1.
-
A024102: a(n) = 9^n - n.
-
A024103: a(n) = 9^n - n^2.
-
A024104: a(n) = 9^n - n^3.
-
A024105: a(n) = 9^n - n^4.
-
A024106: a(n) = 9^n-n^5.
-
A024107: a(n) = 9^n - n^6.
-
A024108: a(n) = 9^n-n^7.
-
A024109: a(n) = 9^n - n^8.
-
A024110: a(n) = 9^n - n^9.
-
A024111: a(n) = 9^n - n^10.
-
A024112: a(n) = 9^n - n^11.
-
A024113: a(n) = 9^n-n^12.
-
A024115: a(n) = 10^n - n.
-
A024116: a(n) = 10^n - n^2.
-
A024117: a(n) = 10^n - n^3.
-
A024118: a(n) = 10^n - n^4.
-
A024119: a(n) = 10^n - n^5.
-
A024120: a(n) = 10^n - n^6.
-
A024121: a(n) = 10^n - n^7.
-
A024122: a(n) = 10^n - n^8.
-
A024123: a(n) = 10^n - n^9.
-
A024124: a(n) = 10^n - n^10.
-
A024125: a(n) = 10^n - n^11.
-
A024126: a(n) = 10^n - n^12.
-
A024127: a(n) = 11^n-1.
-
A024128: a(n) = 11^n - n.
-
A024129: 11^n-n^2.
-
A024130: a(n) = 11^n - n^3.
-
A024131: a(n) = 11^n - n^4.
-
A024132: a(n) = 11^n - n^5.
-
A024133: a(n) = 11^n - n^6.
-
A024134: a(n) = 11^n - n^7.
-
A024135: a(n) = 11^n - n^8.
-
A024136: a(n) = 11^n - n^9.
-
A024137: a(n) = 11^n - n^10.
-
A024138: a(n) = 11^n - n^11.
-
A024139: a(n) = 11^n - n^12.
-
A024140: a(n) = 12^n - 1.
-
A024141: a(n) = 12^n - n.
-
A024142: 12^n-n^2.
-
A024143: a(n) = 12^n - n^3.
-
A024144: a(n) = 12^n - n^4.
-
A024145: a(n) = 12^n - n^5.
-
A024146: a(n) = 12^n - n^6.
-
A024147: a(n) = 12^n - n^7.
-
A024148: a(n) = 12^n - n^8.
-
A024149: a(n) = 12^n - n^9.
-
A024150: a(n) = 12^n - n^10.
-
A024151: a(n) = 12^n - n^11.
-
A024152: a(n) = 12^n - n^12.
-
A024164: Number of integer-sided triangles with sides a,b,c, a<b<c, a+b+c=n such that c - b = b - a.
-
A024166: a(n) = Sum_{1 <= i < j <= n} (j-i)^3.
-
A024167: a(n) = n!*(1 - 1/2 + 1/3 - … + c/n), where c = (-1)^(n+1).
-
A024169: Integer part of ((2nd elementary symmetric function of 1,2,…,n)/(1+2+…+n)).
-
A024172: Integer part of ((3rd elementary symmetric function of 1,2,..,n)/(2nd elementary symmetric function of 1,2,…,n)).
-
A024174: a(n) is floor((4th elementary symmetric function of 1,2,..,n)/(3rd elementary symmetric function of 1,2,…,n)).
-
A024177: a(n) = floor ( (2nd elementary symmetric function of 2,3,…,n+2)/(2+3+…+n+2) ).
-
A024182: Integer part of ((4th elementary symmetric function of 2,3,…,n+4)/(3rd elementary symmetric function of 2,3,…,n+4)).
-
A024196: a(n) = 2nd elementary symmetric function of the first n+1 odd positive integers.
-
A024201: [ (2nd elementary symmetric function of S(n))/(first elementary symmetric function of S(n)) ], where S(n) = {first n+1 odd positive integers}.
-
A024206: Expansion of x^2*(1+x-x^2)/((1-x^2)*(1-x)^2).
-
A024215: Sum of squares of first n positive integers congruent to 1 mod 3.
-
A024219: a(n) = floor( (2nd elementary symmetric function of S(n))/(first elementary symmetric function of S(n)) ), where S(n) = {first n+1 positive integers congruent to 1 mod 3}.
-
A024224: a(n) = floor((4th elementary symmetric function of S(n))/(3rd elementary symmetric function of S(n))), where S(n) = {first n+3 positive integers congruent to 1 mod 3}.
-
A024351: Primes forming a 3 X 3 magic square with prime entries and minimal constant 177 = A164843(3).
-
A024352: Numbers which are the difference of two positive squares, c^2 - b^2 with 1 <= b < c.
-
A024381: a(n) = sum of squares of first n positive integers congruent to 1 mod 4.
-
A024385: a(n) = [ (2nd elementary symmetric function of S(n))/(first elementary symmetric function of S(n)) ], where S(n) = {first n+1 positive integers congruent to 1 mod 4}.
-
A024394: a(n) is the sum of squares of the first n positive integers congruent to 2 mod 3.
-
A024398: a(n) = [ (2nd elementary symmetric function of S(n))/(first elementary symmetric function of S(n)) ], where S(n) = {first n+1 positive integers congruent to 2 mod 3}.
-
A024401: a(n) = [ (3rd elementary symmetric function of S(n))/(2nd elementary symmetric function of S(n)) ], where S(n) = {first n+2 positive integers congruent to 2 mod 3}.
-
A024403: [ (4th elementary symmetric function of S(n))/(3rd elementary symmetric function of S(n)) ], where S(n) = {first n+3 positive integers congruent to 2 mod 3}.
-
A024483: a(n) = binomial(2*n, n) mod binomial(2*n-2, n-1).
-
A024484: Duplicate of A007226.
-
A024486: a(n) = (1/(2n+1))*Multinomial(3n; n,n,n).
-
A024488: a(n) = (1/(3n-1))*M(3n; n,n,n), where M(…) is a multinomial coefficient.
-
A024489: a(n) = (1/(9n-3))*M(3n; n,n,n), where M() is a multinomial coefficient.
-
A024490: a(n) = C(n-1,1) + C(n-3,3) + … + C(n-2*m-1,2*m+1), where m = floor((n-2)/4).
-
A024492: Catalan numbers with odd index: a(n) = binomial(4*n+2, 2*n+1)/(2*n+2).
-
A024493: a(n) = C(n,0) + C(n,3) + … + C(n,3[n/3]).
-
A024494: a(n) = C(n,1) + C(n,4) + … + C(n, 3*floor(n/3) + 1).
-
A024495: a(n) = C(n,2) + C(n,5) + … + C(n, 3*floor(n/3)+2).
-
A024498: a(n) = [ C(2n,n)/n ].
-
A024499: a(n) = [ C(2n,n)/(n-1) ].
-
A024500: a(n) = [ C(2n,n)/n^2 ].
-
A024502: a(n) = floor(C(2n,n)/2^n).
-
A024503: a(n) = floor(binomial(2*n,n)/3^n).
-
A024504: a(n) = floor(C(2n,n)/2^(n+1)).
-
A024505: a(n) = [ C(2n,n)/2^(n+2) ].
-
A024506: a(n) = [ C(2n,n)/2^(n+3) ].
-
A024537: a(n) = floor( a(n-1)/(sqrt(2) - 1) ), with a(0) = 1.
-
A024551: a(n) = floor(a(n-1)/(sqrt(5) - 2)) for n > 0 and a(0) = 1.
-
A024557: a(n) = [ a(n-1)/(sqrt(6) - 2) ], where a(0) = 1.
-
A024567: a(n) = integer nearest a(n-1)/(sqrt(7) - 2), where a(1) = 1.
-
A024718: a(n) = (1/2)*(1 + Sum_{k=0..n} binomial(2*k, k)).
-
A024763: Every prefix prime in base 3 (written in base 3).
-
A024811: a(n) = floor(tan(m*Pi/2)), where m = 1 - 1/n.
-
A024851: Least m such that if r and s in {-F(2*h) + tau*F(2*h-1): h = 1,2,…,n} satisfy r < s, then r < k/m < s for some integer k, where F = A000045 (Fibonacci numbers) and tau = (1+sqrt(5))/2 (golden ratio).
-
A024966: 7 times triangular numbers: 7*n*(n+1)/2.