Sequences
392,541 sequences
- E.g.f.: exp(x*exp(x*exp(x*exp(x))) + 1/2*x^2*exp(x*exp(x*exp(x)))^2).A060911
E.g.f.: exp(x*exp(x*exp(x*exp(x))) + 1/2*x^2*exp(x*exp(x*exp(x)))^2).
- E.g.f.: exp(x*exp(x*exp(x*exp(x*exp(x)))) + 1/2*x^2*exp(x*exp(x*exp(x*exp(x))))^2).A060912
E.g.f.: exp(x*exp(x*exp(x*exp(x*exp(x)))) + 1/2*x^2*exp(x*exp(x*exp(x*exp(x))))^2).
- E.g.f.: exp(x*exp(x*exp(x*exp(x))) + 1/3*x^3*exp(x*exp(x*exp(x)))^3).A060913
E.g.f.: exp(x*exp(x*exp(x*exp(x))) + 1/3*x^3*exp(x*exp(x*exp(x)))^3).
- Integers i > 1 for which there are two primes p such that i is a solution mod p of x^3 = 2.A060914
Integers i > 1 for which there are two primes p such that i is a solution mod p of x^3 = 2.
- Similar to A060399, but more than one digit may be taken (in order) from each prime.A060915
Similar to A060399, but more than one digit may be taken (in order) from each prime.
- Similar to A060400, but more than one digit may be taken (in order) from each prime.A060916
Similar to A060400, but more than one digit may be taken (in order) from each prime.
- Expansion of e.g.f.: exp((-1)^k/k*LambertW(-x)^k)/(k-1)!, k=3.A060917
Expansion of e.g.f.: exp((-1)^k/k*LambertW(-x)^k)/(k-1)!, k=3.
- Expansion of e.g.f.: exp((-1)^k/k*LambertW(-x)^k)/(k-1)!, k=4.A060918
Expansion of e.g.f.: exp((-1)^k/k*LambertW(-x)^k)/(k-1)!, k=4.
- Number of corners in a 4-sided fractal.A060919
Number of corners in a 4-sided fractal.
- Bisection of Fibonacci triangle A037027: even-indexed members of column sequences of A037027 (not counting leading zeros).A060920
Bisection of Fibonacci triangle A037027: even-indexed members of column sequences of A037027 (not counting leading zeros).
- Bisection of Fibonacci triangle A037027: odd-indexed members of column sequences of A037027 (not counting leading zeros).A060921
Bisection of Fibonacci triangle A037027: odd-indexed members of column sequences of A037027 (not counting leading zeros).
- Convolution triangle for Lucas numbers A000032(n+1), n >= 0.A060922
Convolution triangle for Lucas numbers A000032(n+1), n >= 0.
- Bisection of Lucas triangle A060922: even-indexed members of column sequences of A060922 (not counting leading zeros).A060923
Bisection of Lucas triangle A060922: even-indexed members of column sequences of A060922 (not counting leading zeros).
- Bisection of Lucas triangle A060922: odd-indexed members of column sequences of A060922 (not counting leading zeros).A060924
Bisection of Lucas triangle A060922: odd-indexed members of column sequences of A060922 (not counting leading zeros).
- a(n) = 2*a(n-1) + 3*a(n-2), a(0) = 1, a(1) = 4.A060925
a(n) = 2*a(n-1) + 3*a(n-2), a(0) = 1, a(1) = 4.
- Row sums of triangle A060923 (even part of bisection of Lucas triangle).A060926
Row sums of triangle A060923 (even part of bisection of Lucas triangle).
- Row sums of triangle A060924 (odd part of bisection of Lucas triangle).A060927
Row sums of triangle A060924 (odd part of bisection of Lucas triangle).
- Expansion of 1/(1 - 5*x - 4*x^3).A060928
Expansion of 1/(1 - 5*x - 4*x^3).
- Second convolution of Lucas numbers A000032(n+1), n >= 0.A060929
Second convolution of Lucas numbers A000032(n+1), n >= 0.
- Third convolution of Lucas numbers A000032(n+1), n >= 0.A060930
Third convolution of Lucas numbers A000032(n+1), n >= 0.
- Fourth convolution of Lucas numbers A000032(n+1), n >= 0.A060931
Fourth convolution of Lucas numbers A000032(n+1), n >= 0.
- Fifth convolution of Lucas numbers A000032(n+1), n >= 0.A060932
Fifth convolution of Lucas numbers A000032(n+1), n >= 0.
- Sixth convolution of Lucas numbers A000032(n+1), n >= 0.A060933
Sixth convolution of Lucas numbers A000032(n+1), n >= 0.
- Second column of Lucas bisection triangle (even part).A060934
Second column of Lucas bisection triangle (even part).
- Sum of entries in n-th antidiagonal in A060854.A060935
Sum of entries in n-th antidiagonal in A060854.
- Multiples of 3 with digits grouped in pairs and leading zeros omitted.A060936
Multiples of 3 with digits grouped in pairs and leading zeros omitted.
- Number of iterations of d(n) (A000005) needed to reach 2 starting at n (n is counted).A060937
Number of iterations of d(n) (A000005) needed to reach 2 starting at n (n is counted).
- Maximal degree of an irreducible representation of a group with n elements.A060938
Maximal degree of an irreducible representation of a group with n elements.
- a(n) = (Sum of the first n primes) + n.A060939
a(n) = (Sum of the first n primes) + n.
- Triangle in which n-th row gives the phi(n) terms appearing as initial primes in arithmetic progressions with difference n, with initial term equal to the smallest positive residue coprimes to n.A060940
Triangle in which n-th row gives the phi(n) terms appearing as initial primes in arithmetic progressions with difference n, with initial term equal to the smallest positive residue coprimes to n.
- Duchon's numbers: the number of paths of length 5*n from the origin to the line y = 2*x/3 with unit East and North steps that stay below the line or touch it.A060941
Duchon's numbers: the number of paths of length 5*n from the origin to the line y = 2*x/3 with unit East and North steps that stay below the line or touch it.
- a(n) is the largest integer m such that m is divisible by every integer in the interval 1 <= x <= m^(1/n).A060942
a(n) is the largest integer m such that m is divisible by every integer in the interval 1 <= x <= m^(1/n).
- a(n) = n!^n * Sum_{k=1..n} 1/k^n.A060943
a(n) = n!^n * Sum_{k=1..n} 1/k^n.
- a(n) = n!^2 * Sum_{k=1..n} Sum_{j=1..k} 1/j^2.A060944
a(n) = n!^2 * Sum_{k=1..n} Sum_{j=1..k} 1/j^2.
- Number of compositions (ordered partitions) of n into 1's, 2's and 4's.A060945
Number of compositions (ordered partitions) of n into 1's, 2's and 4's.
- Trace of Vandermonde matrix of numbers 1,2,...,n, i.e., the matrix A with A[i,j] = i^(j-1), 1 <= i <= n, 1 <= j <= n.A060946
Trace of Vandermonde matrix of numbers 1,2,...,n, i.e., the matrix A with A[i,j] = i^(j-1), 1 <= i <= n, 1 <= j <= n.
- Intrinsic 10-palindromes: n is an intrinsic k-palindrome if it is a k-digit palindrome in some base.A060947
Intrinsic 10-palindromes: n is an intrinsic k-palindrome if it is a k-digit palindrome in some base.
- Intrinsic 11-palindromes: n is an intrinsic k-palindrome if it is a k-digit palindrome in some base.A060948
Intrinsic 11-palindromes: n is an intrinsic k-palindrome if it is a k-digit palindrome in some base.
- Intrinsic 12-palindromes: n is an intrinsic k-palindrome if it is a k-digit palindrome in some base.A060949
Intrinsic 12-palindromes: n is an intrinsic k-palindrome if it is a k-digit palindrome in some base.
- Rank of elliptic curve y^2 = x^3 + n.A060950
Rank of elliptic curve y^2 = x^3 + n.
- Rank of elliptic curve y^2 = x^3 - n.A060951
Rank of elliptic curve y^2 = x^3 - n.
- Rank of elliptic curve y^2 = x^3 - n*x.A060952
Rank of elliptic curve y^2 = x^3 - n*x.
- Rank of elliptic curve y^2 = x^3 + n*x.A060953
Rank of elliptic curve y^2 = x^3 + n*x.
- Largest prime factor of 10*n + 1.A060954
Largest prime factor of 10*n + 1.
- Highest degree of an irreducible representation of the alternating group A_n of degree n.A060955
Highest degree of an irreducible representation of the alternating group A_n of degree n.
- Leading digit of 3^n.A060956
Leading digit of 3^n.
- Number of different products (including the empty product) of any subset of {1, 2, 3, ..., n}.A060957
Number of different products (including the empty product) of any subset of {1, 2, 3, ..., n}.
- Gregorian Easter dates, starting after 2000-04-23, a(2000) = 54.A060958
Gregorian Easter dates, starting after 2000-04-23, a(2000) = 54.
- Table by antidiagonals of generalized Fibonacci numbers: T(n,k) = T(n,k-1) + n*T(n,k-2) with T(n,0)=0 and T(n,1)=1.A060959
Table by antidiagonals of generalized Fibonacci numbers: T(n,k) = T(n,k-1) + n*T(n,k-2) with T(n,0)=0 and T(n,1)=1.
- Duplicate of A073642.A060960
Duplicate of A073642.