Summary of block A097
Sequences in block A097
Section titled “Sequences in block A097”-
A097038: A Jacobsthal variant.
-
A097039: a(n) = Sum_{i=0..n} i*L(i), where L = A000032.
-
A097040: a(n) = 2*sum(C(n,2k+1)*F(2k), k=0..floor((n-1)/2)), where F(n) are Fibonacci numbers A000045.
-
A097043: a(n) = n - a(floor(sqrt(n))) for n > 1; a(1) = 1.
-
A097053: First occurrence of n in A097051.
-
A097062: Interleave 2*n+1 and 2*n-1.
-
A097063: Expansion of (1-2*x+3*x^2)/((1+x)*(1-x)^3).
-
A097064: Expansion of (1 - 4*x + 6*x^2)/(1 - 2*x)^2.
-
A097065: Interleave n+1 and n-1.
-
A097066: Expansion of (1-2*x+2*x^2)/((1+x)*(1-x)^3).
-
A097067: Expansion of g.f. (1-4*x+5*x^2)/(1-2*x)^2.
-
A097068: a(n)=Sum(C(n,2k+1)5^k 3^(2k+1) 7^(n-2k-1), k=0,..,Floor[(n-1)/2]).
-
A097070: Consider all compositions (ordered partitions) of n into n parts, allowing zeros. E.g., for n = 3 we get 300, 030, 003, 210, 120, 201, 102, 021, 012, 111. Then a(n) is the total number of 1’s.
-
A097072: Expansion of (1 - 2*x + 2*x^2)/((1 - x^2)*(1 - 2*x)).
-
A097073: Expansion of (1-x+2*x^2)/((1+x)*(1-2*x)).
-
A097074: Expansion of (1-x+2*x^2)/((1-x)*(1-x-2*x^2)).
-
A097075: Expansion of g.f. (1-x-x^2)/(1-x-3*x^2-x^3).
-
A097076: Expansion of g.f. x/(1 - x - 3*x^2 - x^3).
-
A097080: a(n) = 2*n^2 - 2*n + 3.
-
A097083: Positive values of k such that there is exactly one permutation p of (1,2,3,…,k) such that i+p(i) is a Fibonacci number for 1<=i<=k.
-
A097110: Expansion of (1 + 2x - 2x^3) / (1 - 3x^2 + 2x^4).
-
A097131: F(n)+(-1)^n*F(n-1).
-
A097132: a(n) = Sum_{k=0..n} Fibonacci(k) + (-1)^k*Fibonacci(k-1).
-
A097133: a(n) = 3*Fibonacci(n) + (-1)^n.
-
A097134: a(n) = 3*Fibonacci(2*n) + 0^n.
-
A097135: a(0) = 1; for n>0, a(n) = 3*Fibonacci(n).
-
A097136: a(n) = 3*Fibonacci(2*n) + 1.
-
A097137: Convolution of 3^n and floor(n/2).
-
A097138: Convolution of 4^n and floor(n/2).
-
A097139: Convolution of 5^n and floor(n/2).
-
A097140: Interleave n and 1-n.
-
A097141: Expansion of x*(1+2*x)/(1+x)^2.
-
A097163: Expansion of (1+x-x^2)/((1-x)*(1-4*x^2)).
-
A097164: Expansion of (1+3x)/((1-x)(1-4x^2)).
-
A097165: Expansion of (1-3x)/((1-x)(1-4x)(1-5x)).
-
A097166: Expansion of g.f. (1+2*x)/((1-x)*(1-10*x)).
-
A097183: Main diagonal of triangle A097181, in which the n-th row polynomial R_n(y) is formed from the initial (n+1) terms of g.f. A097182(y)^(n+1), where R_n(1/2) = 8^n for all n>=0.
-
A097184: G.f. A(x) satisfies A097182(x*A(x)) = A(x) and so equals the ratio of the g.f.s of any two adjacent diagonals of triangle A097181.
-
A097188: G.f. A(x) satisfies A057083(x*A(x)) = A(x) and so equals the ratio of the g.f.s of any two adjacent diagonals of triangle A097186.
-
A097204: Binomial transform of A033312.
-
A097280: Perimeter of integer triangle (A001611(n), A001611(n+1), A001611(n+2)).
-
A097314: Pell equation solutions (3*a(n))^2 - 10*b(n)^2 = -1 with b(n) = A097315(n), n >= 0.
-
A097315: Pell equation solutions (3*b(n))^2 - 10*a(n)^2 = -1 with b(n) = A097314(n), n >= 0.
-
A097316: Chebyshev U(n,x) polynomial evaluated at x=33.
-
A097321: a(n) = (3*n-1) * 3*n * (3*n+1).
-
A097334: a(n) = Sum_{k=0..n} C(n-k, floor(k/2))*2^k.
-
A097339: 2^n+n^3.
-
A097350: Numbers n such that (Sum (2k)^k, k=1..n) - 1 is prime.
-
A097362: a(n) = (n+1)/2 if n is odd, n+2 otherwise.
-
A097369: Position in row n of Fibonacci regression array (A097367) where the least term first occurs.
-
A097383: Minimum total number of comparisons to find each of the values 1 through n using a binary search with 3-way comparisons (less than, equal and greater than).
-
A097388: 2n-th derivative of the Gaussian exp(-x^2) evaluated at x=0.
-
A097396: Duplicate of A056788.
-
A097419: a(1) = 2, a(n) = 2*a(n-1)^2 - a(n-1) for n > 1.
-
A097421: a(n) = (5^(2^n) - 1)/2^(n+2).
-
A097432: Integer part of the hypotenuse of right triangles with consecutive integer legs.
-
A097462: Multiplication table for numbers 0 through 10 read by rows.
-
A097476: a(n) = Product_{i=0..n-1} ((2i)!)^2.
-
A097482: a(1) = 1, a(2) = 1, a(n) = floor(sqrt(a(n-2)*a(n-1))) + 3 for n > 2.
-
A097506: Duplicate of A001951.
-
A097508: a(n) = floor(n*(sqrt(2)-1)).
-
A097547: a(n) = n^(2^n).
-
A097578: a(n) = (2*n+1)*2^floor((n+1)/2).
-
A097581: a(n) = 3*2^floor((n-1)/2) + (-1)^n.
-
A097594: a(n) = (a(n-1) mod a(n-2)) + a(n-2), a(0) = 3, a(1) = 2.
-
A097613: a(n) = binomial(2n-3,n-1) + binomial(2n-2,n-2).
-
A097629: a(n) = 2*(2n)^(n-2).
-
A097632: a(n) = 2^n * Lucas(n) * (n-1)!.
-
A097653: Numbers n such that n=d_1!!+d_2!!+…+d_k!! where d_1 d_2 … d_k is the decimal expansion of n.
-
A097654: Numbers n such that n=|d_1!!-d_2!!+…+(-1)^(k-1)*d_k!!| where d_1 d_2 … d_k is the decimal expansion of n.
-
A097656: Binomial transform of A038507.
-
A097657: Fibonacci sequence with first two terms 11 and 23.
-
A097658: Duplicate of A067725.
-
A097659: a(n) = 1001^n.
-
A097725: Chebyshev U(n,x) polynomial evaluated at x=51.
-
A097727: Pell equation solutions (5*b(n))^2 - 26*a(n)^2 = -1 with b(n)=A097726(n), n >= 0.
-
A097728: Chebyshev U(n,x) polynomial evaluated at x=73 = 2*6^2+1.
-
A097730: Pell equation solutions (6*b(n))^2 - 37*a(n)^2 = -1 with b(n)=A097729(n), n >= 0.
-
A097731: Chebyshev U(n,x) polynomial evaluated at x=99 gives 2*7^2+1.
-
A097733: Pell equation solutions (7*b(n))^2 - 2*(5*a(n))^2 = -1 with b(n)=A097732(n), n >= 0. Note that D=50=2*5^2 is not squarefree.
-
A097734: Chebyshev U(n,x) polynomial evaluated at x=129 = 3*43.
-
A097736: Pell equation solutions (8*b(n))^2 - 65*a(n)^2 = -1 with b(n):=A097735(n), n >= 0.
-
A097737: Chebyshev U(n,x) polynomial evaluated at x=163.
-
A097739: Pell equation solutions (9*b(n))^2 - 82*a(n)^2 = -1 with b(n):=A097738(n), n >= 0.
-
A097742: Pell equation solutions (10*b(n))^2 - 101*a(n)^2 = -1 with b(n)=A097741(n), n >= 0.
-
A097765: Chebyshev U(n,x) polynomial evaluated at x=243=2*11^2+1.
-
A097767: Pell equation solutions (11*b(n))^2 - 122*a(n)^2 = -1 with b(n):=A097766(n), n >= 0.
-
A097768: Chebyshev U(n,x) polynomial evaluated at x=289=2*12^2+1.
-
A097770: Pell equation solutions (12*b(n))^2 - 145*a(n)^2 = -1 with b(n)=A097769(n), n >= 0.
-
A097771: Chebyshev U(n,x) polynomial evaluated at x=339=2*13^2+1.
-
A097773: Pell equation solutions (13*b(n))^2 - 170*a(n)^2 = -1 with b(n):=A097772(n), n >= 0.
-
A097776: Pell equation solutions (14*b(n))^2 - 197*a(n)^2 = -1 with b(n)=A097775(n), n >= 0.
-
A097778: Chebyshev polynomials S(n,23) with Diophantine property.
-
A097780: Chebyshev polynomials S(n,25) with Diophantine property.
-
A097781: Chebyshev polynomials S(n,27) with Diophantine property.
-
A097782: Chebyshev polynomials S(n,29) with Diophantine property.
-
A097783: Chebyshev polynomials S(n,11) + S(n-1,11) with Diophantine property.
-
A097784: Partial sums of Chebyshev sequence S(n,10) = U(n,5) = A004189(n+1).
-
A097786: a(n) = 3*a(n-1) + C(n+3,3) for n > 0; a(0)=1.
-
A097787: a(n)=3a(n-1)+C(n+4,4),n>0, a(0)=1.
-
A097801: a(n) = (2*n)!/(n!*2^(n-1)).
-
A097802: a(n) = 3*(25*n + 1).
-
A097803: a(n) = 3*(2*n^2 + 1).
-
A097804: a(n) = 3*(2*5^n + 1).
-
A097806: Riordan array (1+x, 1) read by rows.
-
A097807: Riordan array (1/(1+x),1) read by rows.
-
A097809: a(n) = 5*2^n - 2*n - 4.
-
A097810: a(n) = 7*2^n - 3*n - 6.
-
A097813: a(n) = 3*2^n - 2*n - 2.
-
A097814: E.g.f. exp(3x)/(1-3x).
-
A097815: E.g.f. exp(4x)/(1-4x).
-
A097816: E.g.f. exp(5x)/(1-5x).
-
A097817: E.g.f. exp(2x)/(1-3x).
-
A097818: Expansion of (8+10*x)/((1-x)*(1-100*x)).
-
A097819: E.g.f. exp(3x)/(1-4x).
-
A097820: Expansion of e.g.f. exp(2*x)/(1-4*x).
-
A097826: Partial sums of Chebyshev sequence S(n,11) = U(n,11/2) = A004190(n).
-
A097827: Partial sums of Chebyshev sequence S(n,12)= U(n,6)=A004191(n).
-
A097828: Partial sums of Chebyshev sequence S(n,13)= U(n,13/2)=A078362(n).
-
A097829: Partial sums of Chebyshev sequence S(n,15)= U(n,15/2)=A078364(n).
-
A097830: Partial sums of Chebyshev sequence S(n,16) = U(n,16/2) = A077412(n).
-
A097831: Partial sums of Chebyshev sequence S(n,17)= U(n,17/2)=A078366(n).
-
A097832: Partial sums of Chebyshev sequence S(n,19)= U(n,19/2)=A078368(n).
-
A097833: Partial sums of Chebyshev sequence S(n,20)= U(n,10)=A075843(n+1).
-
A097834: Chebyshev polynomials S(n,27) + S(n-1,27) with Diophantine property.
-
A097835: First differences of Chebyshev polynomials S(n,27) = A097781(n) with Diophantine property.
-
A097836: Chebyshev polynomials S(n,51).
-
A097837: Chebyshev polynomials S(n,51) + S(n-1,51) with Diophantine property.
-
A097838: First differences of Chebyshev polynomials S(n,51) = A097836(n) with Diophantine property.
-
A097839: Chebyshev polynomials S(n,83).
-
A097840: Chebyshev polynomials S(n,83) + S(n-1,83) with Diophantine property.
-
A097841: First differences of Chebyshev polynomials S(n,83) = A097839(n) with Diophantine property.
-
A097843: First differences of Chebyshev polynomials S(n,123) = A049670(n+1) with Diophantine property.
-
A097844: Chebyshev polynomials S(n,171).
-
A097895: Number of compositions of n with at least 1 odd and 1 even part.
-
A097896: Number of compositions of n with either all parts odd or all parts even.
-
A097911: Minimal order of a graph containing as induced subgraphs isomorphic copies of all graphs on n unlabeled nodes.
-
A097921: G.f.: (1-x^6)*(1-x^8)/((1-x)*(1-x^2)*(1-x^3)^2*(1-x^4)).
-
A097924: a(n) = 4*a(n-1) + a(n-2), n>=2, a(0) = 2, a(1) = 7.
-
A097950: G.f.: (1+x^5+x^10)/((1-x)*(1-x^3)).
-
A097967: a(n) = Sum_{k=1..n} (P(n,k) + C(n,k)).
-
A097971: Number of alternating runs in all permutations of [n] (the permutation 732569148 has four alternating runs: 732, 2569, 91 and 148).
-
A097980: Number of weakly eutactic lattices in dimension n.
-
A097989: Numbers n such that n=tau_3(n)=A007425(n).
-
A097992: G.f.: 1/((1-x)*(1-x^6)) = 1/ ( (1+x)*(x^2-x+1)*(1+x+x^2)*(x-1)^2 ).