Sequences
392,541 sequences
- Number of sequences with n copies each of 1, 2, 3 and longest increasing subsequence of length 3.A047911
Number of sequences with n copies each of 1, 2, 3 and longest increasing subsequence of length 3.
- a(1) = 3; for n > 0, a(n+1) = a(n) * sum of digits of a(n).A047912
a(1) = 3; for n > 0, a(n+1) = a(n) * sum of digits of a(n).
- Triangle of numbers a(n,k) = number of partitions of k such that k = n + n_1 + n_2 + ... + n_t where n_1 <= 2n and n_{i+1} <= 2n_i for all i.A047913
Triangle of numbers a(n,k) = number of partitions of k such that k = n + n_1 + n_2 + ... + n_t where n_1 <= 2n and n_{i+1} <= 2n_i for all i.
- Duplicate of A005480.A047914
Duplicate of A005480.
- 3*n^2-2*n+6.A047915
3*n^2-2*n+6.
- Triangular array read by rows: a(n,k) = phi(n/k)*(n/k)^k*k! if k|n else 0 (1<=k<=n).A047916
Triangular array read by rows: a(n,k) = phi(n/k)*(n/k)^k*k! if k|n else 0 (1<=k<=n).
- Triangular array read by rows: a(n,k) = phi(n/k)*(n/k)^k*k!/n if k|n else 0 (1<=k<=n).A047917
Triangular array read by rows: a(n,k) = phi(n/k)*(n/k)^k*k!/n if k|n else 0 (1<=k<=n).
- Triangular array read by rows: a(n,k) = Sum_{d|k} mu(d)*U(n,k/d) if k|n else 0, where U(n,k) = A047916(n,k) (1<=k<=n).A047918
Triangular array read by rows: a(n,k) = Sum_{d|k} mu(d)*U(n,k/d) if k|n else 0, where U(n,k) = A047916(n,k) (1<=k<=n).
- Triangular array read by rows: a(n,k) = Sum_{d|k} mu(d)*U(n,k/d)/n if k|n else 0, where U(n,k) = A047916(n,k) (1<=k<=n).A047919
Triangular array read by rows: a(n,k) = Sum_{d|k} mu(d)*U(n,k/d)/n if k|n else 0, where U(n,k) = A047916(n,k) (1<=k<=n).
- Triangular array formed from successive differences of factorial numbers.A047920
Triangular array formed from successive differences of factorial numbers.
- Triangle of numbers a(n,k) = number of permutations on n letters containing k 3-sequences (n >= 0, 0<=k<=max(0,n-2)).A047921
Triangle of numbers a(n,k) = number of permutations on n letters containing k 3-sequences (n >= 0, 0<=k<=max(0,n-2)).
- Triangle of numbers a(n,k) = number of terms in n X n determinant with 2 adjacent diagonals of k and k-1 0's (0<=k<=n).A047922
Triangle of numbers a(n,k) = number of terms in n X n determinant with 2 adjacent diagonals of k and k-1 0's (0<=k<=n).
- Main diagonal of array in A038150.A047923
Main diagonal of array in A038150.
- a(n) = B_{A_n+1}+1, where A_n = floor(n*phi) = A000201(n), B_n = floor(n*phi^2) = A001950(n) and phi is the golden ratio.A047924
a(n) = B_{A_n+1}+1, where A_n = floor(n*phi) = A000201(n), B_n = floor(n*phi^2) = A001950(n) and phi is the golden ratio.
- 3rd column of array in A038150.A047925
3rd column of array in A038150.
- a(n) = (3^(n+1) + 2*n + 1)/4.A047926
a(n) = (3^(n+1) + 2*n + 1)/4.
- a(n) = n*(n-1)*(n-2)^2.A047927
a(n) = n*(n-1)*(n-2)^2.
- a(n) = n*(n-1)^2*(n-2).A047928
a(n) = n*(n-1)^2*(n-2).
- a(n) = n^2*(n-1)*(n-2).A047929
a(n) = n^2*(n-1)*(n-2).
- Smallest positive Fibonacci number divisible by n.A047930
Smallest positive Fibonacci number divisible by n.
- Number of new penny-penny contacts when putting pennies on a table following a spiral pattern.A047931
Number of new penny-penny contacts when putting pennies on a table following a spiral pattern.
- a(n) = floor(3*n-sqrt(12*n-3)).A047932
a(n) = floor(3*n-sqrt(12*n-3)).
- Consider primes p with least positive primitive root g such that q=p+g is next prime after p; sequence gives values of q.A047933
Consider primes p with least positive primitive root g such that q=p+g is next prime after p; sequence gives values of q.
- Consider primes p with least positive primitive root g such that q=p+g is next prime after p; sequence gives values of p.A047934
Consider primes p with least positive primitive root g such that q=p+g is next prime after p; sequence gives values of p.
- Consider primes p with least positive primitive root g such that q=p+g is next prime after p; sequence gives values of g.A047935
Consider primes p with least positive primitive root g such that q=p+g is next prime after p; sequence gives values of g.
- Primes whose smallest positive primitive root (A001918) is not prime.A047936
Primes whose smallest positive primitive root (A001918) is not prime.
- Number of 2-colorings of an n X n grid, up to rotational symmetry.A047937
Number of 2-colorings of an n X n grid, up to rotational symmetry.
- Number of ways to label points of an n X n grid with 3 colors, up to rotational symmetry.A047938
Number of ways to label points of an n X n grid with 3 colors, up to rotational symmetry.
- Number of 4-colorings of an n X n grid, up to rotational symmetry.A047939
Number of 4-colorings of an n X n grid, up to rotational symmetry.
- Number of 5-colorings of an n X n grid, up to rotational symmetry.A047940
Number of 5-colorings of an n X n grid, up to rotational symmetry.
- Number of 6-colorings of an n X n grid, up to rotational symmetry.A047941
Number of 6-colorings of an n X n grid, up to rotational symmetry.
- Number of 7-colorings of an n X n grid, up to rotational symmetry.A047942
Number of 7-colorings of an n X n grid, up to rotational symmetry.
- Number of 8-colorings of an n X n grid, up to rotational symmetry.A047943
Number of 8-colorings of an n X n grid, up to rotational symmetry.
- Number of 9-colorings of an n X n grid, up to rotational symmetry.A047944
Number of 9-colorings of an n X n grid, up to rotational symmetry.
- Number of 10-colorings of an n X n grid, up to rotational symmetry.A047945
Number of 10-colorings of an n X n grid, up to rotational symmetry.
- a(n) = 5*F(n)^2 + 3*(-1)^n where F(n) are the Fibonacci numbers A000045.A047946
a(n) = 5*F(n)^2 + 3*(-1)^n where F(n) are the Fibonacci numbers A000045.
- a(n) is the number of k values for which A023193(k) = n.A047947
a(n) is the number of k values for which A023193(k) = n.
- Smallest of three consecutive primes with a difference of 6: primes p such that p+6 and p+12 are the next two primes.A047948
Smallest of three consecutive primes with a difference of 6: primes p such that p+6 and p+12 are the next two primes.
- a(n) is the largest m such that n-m and n+m are both primes, or -1 if no such m exists.A047949
a(n) is the largest m such that n-m and n+m are both primes, or -1 if no such m exists.
- Coordination sequence T1 for Zeolite Code AEN.A047950
Coordination sequence T1 for Zeolite Code AEN.
- Coordination sequence T2 for Zeolite Code AEN.A047951
Coordination sequence T2 for Zeolite Code AEN.
- Coordination sequence T3 for Zeolite Code AEN.A047952
Coordination sequence T3 for Zeolite Code AEN.
- Coordination sequence T1 for Zeolite Code DON.A047953
Coordination sequence T1 for Zeolite Code DON.
- Coordination sequence T2 for Zeolite Code DON.A047954
Coordination sequence T2 for Zeolite Code DON.
- Coordination sequence T3 for Zeolite Code DON.A047955
Coordination sequence T3 for Zeolite Code DON.
- Coordination sequence T4 for Zeolite Code DON.A047956
Coordination sequence T4 for Zeolite Code DON.
- Coordination sequence T5 for Zeolite Code DON.A047957
Coordination sequence T5 for Zeolite Code DON.
- Coordination sequence T1 for Zeolite Code ISV.A047958
Coordination sequence T1 for Zeolite Code ISV.
- Coordination sequence T2 for Zeolite Code ISV.A047959
Coordination sequence T2 for Zeolite Code ISV.
- Coordination sequence T3 for Zeolite Code ISV.A047960
Coordination sequence T3 for Zeolite Code ISV.