Sequences
392,541 sequences
- Square number array read by antidiagonals.A084061
Square number array read by antidiagonals.
- Main diagonal of number array A084061.A084062
Main diagonal of number array A084061.
- First subdiagonal of number array A084061.A084063
First subdiagonal of number array A084061.
- Third row of number array A084061.A084064
Third row of number array A084061.
- Fourth row of number array A084061.A084065
Fourth row of number array A084061.
- Least integer coefficients of A(x), where 1<=a(n)<=11, such that A(x)^(1/11) consists entirely of integer coefficients.A084066
Least integer coefficients of A(x), where 1<=a(n)<=11, such that A(x)^(1/11) consists entirely of integer coefficients.
- Integer coefficients of A(x), where 1<=a(n)<=12, such that A(x)^(1/12) consists entirely of integer coefficients.A084067
Integer coefficients of A(x), where 1<=a(n)<=12, such that A(x)^(1/12) consists entirely of integer coefficients.
- a(1) = 1, a(2) = 2; a(2*k) = 2*a(2*k-1) - a(2*k-2), a(2*k+1) = 4*a(2*k) - a(2*k-1).A084068
a(1) = 1, a(2) = 2; a(2*k) = 2*a(2*k-1) - a(2*k-2), a(2*k+1) = 4*a(2*k) - a(2*k-1).
- Numbers k such that 7*k^2 = floor(k*sqrt(7)*ceiling(k*sqrt(7))).A084069
Numbers k such that 7*k^2 = floor(k*sqrt(7)*ceiling(k*sqrt(7))).
- a(n) = 38*a(n-1) - a(n-2), with a(0)=0, a(1)=6.A084070
a(n) = 38*a(n-1) - a(n-2), with a(0)=0, a(1)=6.
- Class 12+ primes.A084071
Class 12+ primes.
- Erroneous version of A049534.A084072
Erroneous version of A049534.
- Starting index of a record-breaking string of consecutive equal digits in the decimal expansion of Pi.A084073
Starting index of a record-breaking string of consecutive equal digits in the decimal expansion of Pi.
- Numbers k such that 11*13^k + 2 is prime.A084074
Numbers k such that 11*13^k + 2 is prime.
- Length of list created by n substitutions k -> Range( -abs(k+1), abs(k-1), 2) starting with {1}.A084075
Length of list created by n substitutions k -> Range( -abs(k+1), abs(k-1), 2) starting with {1}.
- Length of list created by n substitutions k -> Range[-1-abs(k), abs(k)+1] starting with {1}.A084076
Length of list created by n substitutions k -> Range[-1-abs(k), abs(k)+1] starting with {1}.
- Length of list created by n substitutions k -> Range(-abs(k+1), abs(k-1)) starting with {1}.A084077
Length of list created by n substitutions k -> Range(-abs(k+1), abs(k-1)) starting with {1}.
- Length of list created by n substitutions k -> Range[-abs(k+1), abs(k-1), 2] starting with {0}.A084078
Length of list created by n substitutions k -> Range[-abs(k+1), abs(k-1), 2] starting with {0}.
- Sum of absolute values of lists created by n substitutions k -> Range[ -Abs[k+1],Abs[k-1],2] starting with {1}.A084079
Sum of absolute values of lists created by n substitutions k -> Range[ -Abs[k+1],Abs[k-1],2] starting with {1}.
- Length of lists created by n substitutions k -> Range[k+1,1,-3] starting with {1}, counting down from k+1 to 1 step -3.A084080
Length of lists created by n substitutions k -> Range[k+1,1,-3] starting with {1}, counting down from k+1 to 1 step -3.
- Sum of lists created by n substitutions k -> Range[k+1,0,-2] starting with {0}, counting down from k+1 to 0 step -2.A084081
Sum of lists created by n substitutions k -> Range[k+1,0,-2] starting with {0}, counting down from k+1 to 0 step -2.
- Length of lists created by n substitutions k -> Range[ -Floor[Abs[k]/2],Floor[Abs[k]+3/2]] starting with {0}.A084082
Length of lists created by n substitutions k -> Range[ -Floor[Abs[k]/2],Floor[Abs[k]+3/2]] starting with {0}.
- Length of lists created by n substitutions k -> Range[k+1,-Abs[k],-2] starting with {1}.A084083
Length of lists created by n substitutions k -> Range[k+1,-Abs[k],-2] starting with {1}.
- Length of lists created by n substitutions k -> Range[0,1+Mod[k+1,3]] starting with {0}.A084084
Length of lists created by n substitutions k -> Range[0,1+Mod[k+1,3]] starting with {0}.
- Length of lists created by n substitutions k -> Range[0,Mod[k+1,4]] starting with {0}.A084085
Length of lists created by n substitutions k -> Range[0,Mod[k+1,4]] starting with {0}.
- a(n) = Fibonacci(2*n+1) + 2*Fibonacci(2*n-1) - 2^n - [n = 0], where [b] is the Iverson bracket of b.A084086
a(n) = Fibonacci(2*n+1) + 2*Fibonacci(2*n-1) - 2^n - [n = 0], where [b] is the Iverson bracket of b.
- Numbers k not divisible by 3 such that the exponent of the highest power of 2 dividing k is even.A084087
Numbers k not divisible by 3 such that the exponent of the highest power of 2 dividing k is even.
- Numbers k such that k == 2 (mod 3) and the exponent of the highest power of 2 dividing k is even.A084088
Numbers k such that k == 2 (mod 3) and the exponent of the highest power of 2 dividing k is even.
- Numbers k such that k == 1 (mod 3) and the exponent of the highest power of 2 dividing k is even.A084089
Numbers k such that k == 1 (mod 3) and the exponent of the highest power of 2 dividing k is even.
- Numbers k such that k is divisible by 3 or the exponent of the highest power of 2 dividing k is odd. Complement of A084087.A084090
Numbers k such that k is divisible by 3 or the exponent of the highest power of 2 dividing k is odd. Complement of A084087.
- Expansion of Sum_{k>=0} x^2^k/(1+x^2^k+x^2^(k+1)).A084091
Expansion of Sum_{k>=0} x^2^k/(1+x^2^k+x^2^(k+1)).
- Prime power decimal palindromes.A084092
Prime power decimal palindromes.
- Prime power decimal palindromes that are not prime.A084093
Prime power decimal palindromes that are not prime.
- Positions of records in A034690.A084094
Positions of records in A034690.
- First superdiagonal of number array A084061.A084095
First superdiagonal of number array A084061.
- Fifth row of number array A084061.A084096
Fifth row of number array A084061.
- Square array whose rows have e.g.f. exp(x)*cosh(sqrt(k)*x), k>=0, read by ascending antidiagonals.A084097
Square array whose rows have e.g.f. exp(x)*cosh(sqrt(k)*x), k>=0, read by ascending antidiagonals.
- Expansion of e.g.f. exp(x)*tan(2*x)/2.A084098
Expansion of e.g.f. exp(x)*tan(2*x)/2.
- Expansion of (1+x)^2/(1+x^2).A084099
Expansion of (1+x)^2/(1+x^2).
- Expansion of (1+x-x^2-x^3)/(1+x^2).A084100
Expansion of (1+x-x^2-x^3)/(1+x^2).
- Expansion of (1+x)^2/((1-x)*(1+x^2)).A084101
Expansion of (1+x)^2/((1-x)*(1+x^2)).
- Inverse binomial transform of A084101.A084102
Inverse binomial transform of A084101.
- Expansion of (1+x)^3/(1+x^3).A084103
Expansion of (1+x)^3/(1+x^3).
- A period 6 sequence.A084104
A period 6 sequence.
- Middle q of three consecutive primes p,q,r, such that one adjacent prime is near, the other is far and the ratio of the differences (whichever of (r-q)/(q-p) or (q-p)/(r-q) is greater than 1) sets a record.A084105
Middle q of three consecutive primes p,q,r, such that one adjacent prime is near, the other is far and the ratio of the differences (whichever of (r-q)/(q-p) or (q-p)/(r-q) is greater than 1) sets a record.
- Larger difference (r-q or q-p) associated with A084105.A084106
Larger difference (r-q or q-p) associated with A084105.
- A014486-encoding of "Complete Binary Trees".A084107
A014486-encoding of "Complete Binary Trees".
- A014486-indices of "Complete Binary Trees".A084108
A014486-indices of "Complete Binary Trees".
- n is congruent to 1 (mod 4) and is not the sum of two squares.A084109
n is congruent to 1 (mod 4) and is not the sum of two squares.
- Let L(n) = ordered list of divisors of n = {d_1=1, d_2, ..., d_k=n}; set e_1=1, e_i = e_{i-1}/d_i if that is an integer otherwise e_i = e_{i-1}*d_i; then a(n) = e_k.A084110
Let L(n) = ordered list of divisors of n = {d_1=1, d_2, ..., d_k=n}; set e_1=1, e_i = e_{i-1}/d_i if that is an integer otherwise e_i = e_{i-1}*d_i; then a(n) = e_k.