Sequences
392,541 sequences
- a(n)=A085956(3n).A086361
a(n)=A085956(3n).
- a(n) = A085956(3n+1).A086362
a(n) = A085956(3n+1).
- Array T(m,n) read by antidiagonals: if X and Y are two (possibly empty) finite sets with m and n elements respectively and Z is the disjoint union of X and Y, then T(m,n) is the number of self-inverse partial functions f:Z ->Z which do not fix any element of Y.A086363
Array T(m,n) read by antidiagonals: if X and Y are two (possibly empty) finite sets with m and n elements respectively and Z is the disjoint union of X and Y, then T(m,n) is the number of self-inverse partial functions f:Z ->Z which do not fix any element of Y.
- Triangle read by rows: S_D(n,k) = `Type D' Stirling numbers of the second kind.A086364
Triangle read by rows: S_D(n,k) = `Type D' Stirling numbers of the second kind.
- n-th Bell number of type D: Number of symmetric partitions of {-n,...,n}\{0} such that none of the subsets is of the form {j,-j}.A086365
n-th Bell number of type D: Number of symmetric partitions of {-n,...,n}\{0} such that none of the subsets is of the form {j,-j}.
- Number of labeled n-node digraphs in which every node belongs to a directed cycle.A086366
Number of labeled n-node digraphs in which every node belongs to a directed cycle.
- (1/p)*(F(p^2+1)-1) where p runs through the primes (except p = 5) and F(k) is the k-th Fibonacci number.A086367
(1/p)*(F(p^2+1)-1) where p runs through the primes (except p = 5) and F(k) is the k-th Fibonacci number.
- Nonsquarefree numbers k such that sigma(k) is squarefree.A086368
Nonsquarefree numbers k such that sigma(k) is squarefree.
- Number of factors over Q in the factorization of T_n(x) - 1 where T_n(x) is the Chebyshev polynomial of the first kind.A086369
Number of factors over Q in the factorization of T_n(x) - 1 where T_n(x) is the Chebyshev polynomial of the first kind.
- Duplicate of A083788.A086370
Duplicate of A083788.
- a(n) is the sum, over all labeled graphs G on n nodes, of the clique number w(G).A086371
a(n) is the sum, over all labeled graphs G on n nodes, of the clique number w(G).
- First differences of A027349.A086372
First differences of A027349.
- Number of ordered triples (a,b,c) of elements of the symmetric group S_n such that a,b,c generate S_n.A086373
Number of ordered triples (a,b,c) of elements of the symmetric group S_n such that a,b,c generate S_n.
- Number of factors over Q in the factorization of T_n(x) + 1 where T_n(x) is the Chebyshev polynomial of the first kind.A086374
Number of factors over Q in the factorization of T_n(x) + 1 where T_n(x) is the Chebyshev polynomial of the first kind.
- Number of factors over Q in the factorization of U_n(x) + 1 where U_n(x) is the Chebyshev polynomial of the second kind.A086375
Number of factors over Q in the factorization of U_n(x) + 1 where U_n(x) is the Chebyshev polynomial of the second kind.
- Maximal coefficient of the polynomial (1-x)*(1-x^2)*...*(1-x^n).A086376
Maximal coefficient of the polynomial (1-x)*(1-x^2)*...*(1-x^n).
- a(1)=1; a(n)=a(n-1)+2 if n is in the sequence; a(n)=a(n-1)+2 if n and (n-1) are not in the sequence; a(n)=a(n-1)+3 if n is not in the sequence but (n-1) is in the sequence.A086377
a(1)=1; a(n)=a(n-1)+2 if n is in the sequence; a(n)=a(n-1)+2 if n and (n-1) are not in the sequence; a(n)=a(n-1)+3 if n is not in the sequence but (n-1) is in the sequence.
- Sum of successive remainders in computing Euclidean algorithm for (1,1/sqrt(n)) is rational.A086378
Sum of successive remainders in computing Euclidean algorithm for (1,1/sqrt(n)) is rational.
- Numbers such that both 1 + sum of digits and 1 + product of digits are prime.A086379
Numbers such that both 1 + sum of digits and 1 + product of digits are prime.
- Numbers n such that p = n^2 + 2, p+2 and p+6 are consecutive primes.A086380
Numbers n such that p = n^2 + 2, p+2 and p+6 are consecutive primes.
- Numbers k such that p=k^2+2 and p+2 are primes.A086381
Numbers k such that p=k^2+2 and p+2 are primes.
- k divides F(k*n^2+1)-F(k+1) for 1<=k<=a(n) where F(k) is the k-th Fibonacci number.A086382
k divides F(k*n^2+1)-F(k+1) for 1<=k<=a(n) where F(k) is the k-th Fibonacci number.
- Prime terms in the sequence of Pell numbers, A000129.A086383
Prime terms in the sequence of Pell numbers, A000129.
- Odd digits of e.A086384
Odd digits of e.
- Odd digits of Pi.A086385
Odd digits of Pi.
- Numerators of the rational convergents to sqrt(3) if both numerators and denominators are primes.A086386
Numerators of the rational convergents to sqrt(3) if both numerators and denominators are primes.
- Duplicate of A073264.A086387
Duplicate of A073264.
- Duplicate of A008619.A086388
Duplicate of A008619.
- Number of factors over Q in the factorization of U_n(x) - 1 where U_n(x) is the Chebyshev polynomial of the second kind.A086389
Number of factors over Q in the factorization of U_n(x) - 1 where U_n(x) is the Chebyshev polynomial of the second kind.
- Composite n such that F(n^2+1)==1 (mod n) where F(k) denotes the k-th Fibonacci number.A086390
Composite n such that F(n^2+1)==1 (mod n) where F(k) denotes the k-th Fibonacci number.
- Numbers k such that F(k^2+1) == 1 (mod k) where F(k) denotes the k-th Fibonacci number.A086391
Numbers k such that F(k^2+1) == 1 (mod k) where F(k) denotes the k-th Fibonacci number.
- Numbers k such that k/2 is composite and F(k^2+1)==5 (mod k) where F(k) denotes the k-th Fibonacci number.A086392
Numbers k such that k/2 is composite and F(k^2+1)==5 (mod k) where F(k) denotes the k-th Fibonacci number.
- (1/p)*(F(4p^2+1)-5) where F(k) denotes the k-th Fibonacci number and p runs through the primes (except p = 5).A086393
(1/p)*(F(4p^2+1)-5) where F(k) denotes the k-th Fibonacci number and p runs through the primes (except p = 5).
- (-1) times minimal coefficient of the polynomial (1-x)*(1-x^2)*...*(1-x^n).A086394
(-1) times minimal coefficient of the polynomial (1-x)*(1-x^2)*...*(1-x^n).
- Primes found among the numerators of the continued fraction rational approximations to sqrt(2).A086395
Primes found among the numerators of the continued fraction rational approximations to sqrt(2).
- Even digits of e.A086396
Even digits of e.
- Numerators of the rational convergents to sqrt(2) if both numerators and denominators are primes.A086397
Numerators of the rational convergents to sqrt(2) if both numerators and denominators are primes.
- a(1)=1; a(n)=a(n-1)+2 if n is in the sequence; a(n)=a(n-1)+2 if n and (n-1) are not in the sequence; a(n)=a(n-1)+4 if n is not in the sequence but (n-1) is in the sequence.A086398
a(1)=1; a(n)=a(n-1)+2 if n is in the sequence; a(n)=a(n-1)+2 if n and (n-1) are not in the sequence; a(n)=a(n-1)+4 if n is not in the sequence but (n-1) is in the sequence.
- Even digits of Pi.A086399
Even digits of Pi.
- (1/p)*(M(p)-1) where p runs through the odd primes and M(p) = A001006(p) is the p-th Motzkin number.A086400
(1/p)*(M(p)-1) where p runs through the odd primes and M(p) = A001006(p) is the p-th Motzkin number.
- a(n) = M(n) (mod n) where M(n) = A001006(n) is the n-th Motzkin number.A086401
a(n) = M(n) (mod n) where M(n) = A001006(n) is the n-th Motzkin number.
- Nontrivial numbers which are prime and yield another prime when their digits are sorted in descending order.A086402
Nontrivial numbers which are prime and yield another prime when their digits are sorted in descending order.
- Numerators in the convergents of the continued fraction representation of (e-1)/(e+1).A086403
Numerators in the convergents of the continued fraction representation of (e-1)/(e+1).
- Square array of numbers T(n,k) = ((1+sqrt(3))*(k+sqrt(3))^n-(1-sqrt(3))*(k-sqrt(3))^n)/(2*sqrt(3)), read by antidiagonals.A086404
Square array of numbers T(n,k) = ((1+sqrt(3))*(k+sqrt(3))^n-(1-sqrt(3))*(k-sqrt(3))^n)/(2*sqrt(3)), read by antidiagonals.
- Row T(n,3) of number array A086404.A086405
Row T(n,3) of number array A086404.
- Main diagonal of number array A086404.A086406
Main diagonal of number array A086404.
- a[1]=1; a[n+1]=a[n]-1 if mod[prime[a[n]],6]=5, else a[n+1]=a[n]+4.A086407
a[1]=1; a[n+1]=a[n]-1 if mod[prime[a[n]],6]=5, else a[n+1]=a[n]+4.
- a[1]=1; a[n+1]=a[n]-1 if mod[prime[a[n]],6]=1, else a[n+1]=a[n]+4.A086408
a[1]=1; a[n+1]=a[n]-1 if mod[prime[a[n]],6]=1, else a[n+1]=a[n]+4.
- a[1]=1; a[n+1]=a[n]-1 if (prime[a[n]]+1)/2 is even, else a[n+1]=a[n]+4.A086409
a[1]=1; a[n+1]=a[n]-1 if (prime[a[n]]+1)/2 is even, else a[n+1]=a[n]+4.
- Smallest prime factor of 3-smooth numbers, with a(1)=1.A086410
Smallest prime factor of 3-smooth numbers, with a(1)=1.