Sequences
392,541 sequences
- Triangle T(n,m) = Nim-product of n and m, read by rows, 1<=n<=m.A051911
Triangle T(n,m) = Nim-product of n and m, read by rows, 1<=n<=m.
- a(n) is the smallest integer such that the sum of any three ordered terms a(k), k <= n, is unique.A051912
a(n) is the smallest integer such that the sum of any three ordered terms a(k), k <= n, is unique.
- Numbers k such that phi(k)/phi(phi(k)) = 3.A051913
Numbers k such that phi(k)/phi(phi(k)) = 3.
- Values of n at which record values in A052334 are reached.A051914
Values of n at which record values in A052334 are reached.
- Numbers k such that 2*k! + 1 is prime.A051915
Numbers k such that 2*k! + 1 is prime.
- The Greek sequence: 2^a * 3^b * 5^c where a = 0,1,2,3,..., b,c in {0,1}, excluding the terms 1,2; that is: (a,b,c) != (0,0,0), (1,0,0).A051916
The Greek sequence: 2^a * 3^b * 5^c where a = 0,1,2,3,..., b,c in {0,1}, excluding the terms 1,2; that is: (a,b,c) != (0,0,0), (1,0,0).
- Inverse of n under Nim (or Conway) multiplication.A051917
Inverse of n under Nim (or Conway) multiplication.
- Start with n, apply k->2k+1 until reach new record prime; sequence gives number of steps needed.A051918
Start with n, apply k->2k+1 until reach new record prime; sequence gives number of steps needed.
- Start with n, apply k->2k+1 until reach new record prime; sequence gives record primes.A051919
Start with n, apply k->2k+1 until reach new record prime; sequence gives record primes.
- a(n) = binomial(n, floor(n/2)) + 1.A051920
a(n) = binomial(n, floor(n/2)) + 1.
- Duplicate of A023998.A051921
Duplicate of A023998.
- Duplicate of A027810.A051922
Duplicate of A027810.
- Partial sums of A051836.A051923
Partial sums of A051836.
- a(n) = binomial(2*n,n) - binomial(2*n-2,n-1); or (3n-2)*C(n-1), where C = Catalan numbers (A000108).A051924
a(n) = binomial(2*n,n) - binomial(2*n-2,n-1); or (3n-2)*C(n-1), where C = Catalan numbers (A000108).
- a(n) = n*(2*n+5)*(n-1)/6.A051925
a(n) = n*(2*n+5)*(n-1)/6.
- Number of independent sets of nodes in graph C_4 X P_n (n>2).A051926
Number of independent sets of nodes in graph C_4 X P_n (n>2).
- Number of independent vertex sets in the n-prism graph Y_n = K_2 X C_n (n > 2).A051927
Number of independent vertex sets in the n-prism graph Y_n = K_2 X C_n (n > 2).
- Number of independent sets of vertices in graph K_3 X C_n (n > 2).A051928
Number of independent sets of vertices in graph K_3 X C_n (n > 2).
- Number of independent sets of vertices in graph K_4 X C_n (n > 2).A051929
Number of independent sets of vertices in graph K_4 X C_n (n > 2).
- Number of independent sets of vertices in graph K_5 X C_n (n > 2).A051930
Number of independent sets of vertices in graph K_5 X C_n (n > 2).
- Number of independent sets of nodes in graph K_6 X C_n (n > 2).A051931
Number of independent sets of nodes in graph K_6 X C_n (n > 2).
- Number of independent sets of nodes in graph K_7 X C_n (n > 2).A051932
Number of independent sets of nodes in graph K_7 X C_n (n > 2).
- Triangle T(n,m) = Nim-sum (or XOR) of n and m, read by rows, 0<=m<=n.A051933
Triangle T(n,m) = Nim-sum (or XOR) of n and m, read by rows, 0<=m<=n.
- a(n) is the smallest palindrome > a(n-1) such that a(1)+a(2)+...+a(n) is a prime.A051934
a(n) is the smallest palindrome > a(n-1) such that a(1)+a(2)+...+a(n) is a prime.
- a(n) = smallest number > a(n-1) such that a(1) + a(2) + ... + a(n) is a prime.A051935
a(n) = smallest number > a(n-1) such that a(1) + a(2) + ... + a(n) is a prime.
- Truncated triangular numbers: a(n) = n*(n+1)/2 - 9.A051936
Truncated triangular numbers: a(n) = n*(n+1)/2 - 9.
- Truncated triangular pyramid numbers: a(n) = Sum_{k=4..n} (k*(k+1)/2 - 9).A051937
Truncated triangular pyramid numbers: a(n) = Sum_{k=4..n} (k*(k+1)/2 - 9).
- Truncated triangular numbers: a(n) = n*(n+1)/2 - 18.A051938
Truncated triangular numbers: a(n) = n*(n+1)/2 - 18.
- Truncated triangular pyramid numbers: a(n) = (n-5)*(n^2 + 8*n - 66)/6.A051939
Truncated triangular pyramid numbers: a(n) = (n-5)*(n^2 + 8*n - 66)/6.
- Truncated triangular numbers: n*(n+1)/2 - 3*t*(t+1)/2 with t=4.A051940
Truncated triangular numbers: n*(n+1)/2 - 3*t*(t+1)/2 with t=4.
- Truncated triangular pyramid numbers: a(n) = (n-7)*(n^2 + 10*n - 108)/6, n >= 8.A051941
Truncated triangular pyramid numbers: a(n) = (n-7)*(n^2 + 10*n - 108)/6, n >= 8.
- a(n) = n*(n+1)/2 - 45.A051942
a(n) = n*(n+1)/2 - 45.
- Truncated triangular pyramid numbers: a(n) = Sum_{k=9..n} (k*(k+1)/2 - 45).A051943
Truncated triangular pyramid numbers: a(n) = Sum_{k=9..n} (k*(k+1)/2 - 45).
- a(n) = C(n)*(4*n+1) where C(n) = Catalan numbers (A000108).A051944
a(n) = C(n)*(4*n+1) where C(n) = Catalan numbers (A000108).
- a(n) = C(n)*(5*n+1) where C(n) = Catalan numbers (A000108).A051945
a(n) = C(n)*(5*n+1) where C(n) = Catalan numbers (A000108).
- Expansion of g.f.: (1+4*x)/(1-x)^7.A051946
Expansion of g.f.: (1+4*x)/(1-x)^7.
- Partial sums of A034263.A051947
Partial sums of A034263.
- Numbers k such that k*sigma(k) == 2 (mod phi(k)).A051948
Numbers k such that k*sigma(k) == 2 (mod phi(k)).
- Differences of two factorial numbers.A051949
Differences of two factorial numbers.
- Differences between values of tau(n) (A000005): a(n) = tau(n)-tau(n-1).A051950
Differences between values of tau(n) (A000005): a(n) = tau(n)-tau(n-1).
- Second differences of tau(n).A051951
Second differences of tau(n).
- Numbers that are not a sum of 3 positive squares nor are of the form 4^a*(8b+7) and which are not multiples of 4.A051952
Numbers that are not a sum of 3 positive squares nor are of the form 4^a*(8b+7) and which are not multiples of 4.
- Cototient(n) := n - phi(n).A051953
Cototient(n) := n - phi(n).
- a(n) = smallest palindrome > a(n-1) such that a(1)*a(2)*...*a(n) - 1 is a prime.A051954
a(n) = smallest palindrome > a(n-1) such that a(1)*a(2)*...*a(n) - 1 is a prime.
- a(n) = smallest palindrome > a(n-1) such that a(1)*a(2)*...*a(n) + 1 and a(1)*a(2)*...*a(n) - 1 are primes.A051955
a(n) = smallest palindrome > a(n-1) such that a(1)*a(2)*...*a(n) + 1 and a(1)*a(2)*...*a(n) - 1 are primes.
- a(n) = smallest number > a(n-1) such that a(1)*a(2)*...*a(n) + 1 and a(1)*a(2)*...*a(n) - 1 are primes.A051956
a(n) = smallest number > a(n-1) such that a(1)*a(2)*...*a(n) + 1 and a(1)*a(2)*...*a(n) - 1 are primes.
- a(n) = smallest number > a(n-1) such that a(1)*a(2)*...*a(n) - 1 is a prime.A051957
a(n) = smallest number > a(n-1) such that a(1)*a(2)*...*a(n) - 1 is a prime.
- a(n) = 2*a(n-1) + 24*a(n-2), a(0)=0, a(1)=1.A051958
a(n) = 2*a(n-1) + 24*a(n-2), a(0)=0, a(1)=1.
- Expansion of (1+6*x)/((1-2*x-x^2)*(1-x)^2).A051959
Expansion of (1+6*x)/((1-2*x-x^2)*(1-x)^2).
- a(n) = C(n)*(3n+2) where C(n) = Catalan numbers = A000108.A051960
a(n) = C(n)*(3n+2) where C(n) = Catalan numbers = A000108.