Sequences
392,541 sequences
- Number of triangular regions in regular n-gon with all diagonals drawn.A062361
Number of triangular regions in regular n-gon with all diagonals drawn.
- a(n) = floor of Sum_{ d divides n } phi(d)/d.A062362
a(n) = floor of Sum_{ d divides n } phi(d)/d.
- a(n) = Sum_{d|n} d!.A062363
a(n) = Sum_{d|n} d!.
- Number of cyclic subgroups of the group A_n X A_n (where A_n is the alternating group of degree n).A062364
Number of cyclic subgroups of the group A_n X A_n (where A_n is the alternating group of degree n).
- Number of nonisomorphic cyclic subgroups of the group A_n X A_n (where A_n is the alternating group of degree n).A062365
Number of nonisomorphic cyclic subgroups of the group A_n X A_n (where A_n is the alternating group of degree n).
- Let f be a function on rationals p/q (p,q coprime) defined by f(p/q) = abs(p-q)/nextoddColl(p) (so the denominator is the next odd number in the Collatz trajectory of p). Start with f(n/1) and repeat application of f until it reaches again an integer, which is a(n). If no integer is reached, then a(n)=0.A062366
Let f be a function on rationals p/q (p,q coprime) defined by f(p/q) = abs(p-q)/nextoddColl(p) (so the denominator is the next odd number in the Collatz trajectory of p). Start with f(n/1) and repeat application of f until it reaches again an integer, which is a(n). If no integer is reached, then a(n)=0.
- Multiplicative with a(p^e) = (e+1)*(e+2)*(2*e+3)/6.A062367
Multiplicative with a(p^e) = (e+1)*(e+2)*(2*e+3)/6.
- Multiplicative with a(p^e) = (e+1)*(e+2)*(4*e+3)/6.A062368
Multiplicative with a(p^e) = (e+1)*(e+2)*(4*e+3)/6.
- Dirichlet convolution of n and tau^2(n).A062369
Dirichlet convolution of n and tau^2(n).
- a(n) = Sum_{i|n,j|n} sigma(i)*sigma(j)/sigma(gcd(i,j)), where sigma(n) = sum of divisors of n.A062370
a(n) = Sum_{i|n,j|n} sigma(i)*sigma(j)/sigma(gcd(i,j)), where sigma(n) = sum of divisors of n.
- Numbers the product of whose nonzero digits is a perfect square.A062371
Numbers the product of whose nonzero digits is a perfect square.
- Numbers the product of whose nonzero digits is a cube.A062372
Numbers the product of whose nonzero digits is a cube.
- Ratio of totient to Carmichael's lambda function is 2.A062373
Ratio of totient to Carmichael's lambda function is 2.
- Euler phi(n) / Carmichael lambda(n) = 4.A062374
Euler phi(n) / Carmichael lambda(n) = 4.
- Euler phi(n) / Carmichael lambda(n) = 6.A062375
Euler phi(n) / Carmichael lambda(n) = 6.
- Numbers k such that Euler phi(k) / Carmichael lambda(k) = 8.A062376
Numbers k such that Euler phi(k) / Carmichael lambda(k) = 8.
- Euler phi(n) / Carmichael lambda(n) = 10.A062377
Euler phi(n) / Carmichael lambda(n) = 10.
- n divided by largest cubefree factor of n.A062378
n divided by largest cubefree factor of n.
- n divided by largest 4th-power-free factor of n.A062379
n divided by largest 4th-power-free factor of n.
- a(n) = Sum_{i|n,j|n} phi(i)*phi(j)/phi(gcd(i,j)), where phi is Euler totient function.A062380
a(n) = Sum_{i|n,j|n} phi(i)*phi(j)/phi(gcd(i,j)), where phi is Euler totient function.
- Let A_n be the n X n matrix defined by A_n[i,j] = 1/F(i+j-1) for 1<=i,j<=n where F(k) is the k-th Fibonacci number (A000045). Then a_n = 1/det(A_n).A062381
Let A_n be the n X n matrix defined by A_n[i,j] = 1/F(i+j-1) for 1<=i,j<=n where F(k) is the k-th Fibonacci number (A000045). Then a_n = 1/det(A_n).
- Positive numbers whose product of digits is 5 times their sum.A062382
Positive numbers whose product of digits is 5 times their sum.
- a(0) = 1: for n>0, a(n) = 2^floor(log_2(n)+1) or a(n) = 2*a(floor(n/2)).A062383
a(0) = 1: for n>0, a(n) = 2^floor(log_2(n)+1) or a(n) = 2*a(floor(n/2)).
- Positive numbers whose product of digits is 7 times their sum.A062384
Positive numbers whose product of digits is 7 times their sum.
- Numbers k such that sigma(k) - phi(k) is a cube.A062385
Numbers k such that sigma(k) - phi(k) is a cube.
- Number of alternating link diagrams with n crossings, 1 connected component and two external legs.A062386
Number of alternating link diagrams with n crossings, 1 connected component and two external legs.
- Squares in which removing a suitably chosen digit yields another square and this process can be continued until the digits are exhausted.A062387
Squares in which removing a suitably chosen digit yields another square and this process can be continued until the digits are exhausted.
- Smallest palindrome with digit sum = n.A062388
Smallest palindrome with digit sum = n.
- a(n) = floor( (2n-1)*Pi/2 ).A062389
a(n) = floor( (2n-1)*Pi/2 ).
- Numbers k such that (k + R(k)) / (k - R(k)) = +-11 where R(k) is the digit reversal of k (A004086).A062390
Numbers k such that (k + R(k)) / (k - R(k)) = +-11 where R(k) is the digit reversal of k (A004086).
- a(1) = 3, a(2) = 5; a(n+1) = smallest prime number > a(n) such that the sum of any three consecutive terms is a prime.A062391
a(1) = 3, a(2) = 5; a(n+1) = smallest prime number > a(n) such that the sum of any three consecutive terms is a prime.
- a(n) = n^4 - (n-1)^4 + (n-2)^4 - ... 0^4.A062392
a(n) = n^4 - (n-1)^4 + (n-2)^4 - ... 0^4.
- a(n) = n^5 - (n-1)^5 + (n-2)^5 - ... +(-1)^n*0^5.A062393
a(n) = n^5 - (n-1)^5 + (n-2)^5 - ... +(-1)^n*0^5.
- a(n) = 6^n + 1.A062394
a(n) = 6^n + 1.
- a(n) = 8^n + 1.A062395
a(n) = 8^n + 1.
- a(n) = 9^n + 1.A062396
a(n) = 9^n + 1.
- a(n) = 10^n + 1.A062397
a(n) = 10^n + 1.
- Numbers such that the product of the digits and the sum of the digits are squares.A062398
Numbers such that the product of the digits and the sum of the digits are squares.
- Smallest multiple of n with property that each digit is one less (mod 10) than the previous digit; or 0 if no such multiple exists.A062399
Smallest multiple of n with property that each digit is one less (mod 10) than the previous digit; or 0 if no such multiple exists.
- Smallest multiple of n with property that digits are even and each digit is two more (mod 10) than the previous digit; or 0 if no such multiple exists.A062400
Smallest multiple of n with property that digits are even and each digit is two more (mod 10) than the previous digit; or 0 if no such multiple exists.
- a(n) = phi(sigma(n)).A062401
a(n) = phi(sigma(n)).
- a(n) = sigma(phi(n)).A062402
a(n) = sigma(phi(n)).
- Primes of the form 2*k*prime(k) + 1.A062403
Primes of the form 2*k*prime(k) + 1.
- Numbers k such that 2*k*prime(k) + 1 is prime.A062404
Numbers k such that 2*k*prime(k) + 1 is prime.
- Sums of specific numbers when generating a type of triangle based on pi(x).A062405
Sums of specific numbers when generating a type of triangle based on pi(x).
- Cardinality of the (ordered) list L_n defined inductively by: L_1 = {2}; L_(n+1) = L_n - {p}, where p is the first member of L_n, from left to right, such that prime(n+1) can be appended to the end or beginning of p so that the neighboring digits are equal, if p exists; append prime(n+1) to the end of L_n, otherwise.A062406
Cardinality of the (ordered) list L_n defined inductively by: L_1 = {2}; L_(n+1) = L_n - {p}, where p is the first member of L_n, from left to right, such that prime(n+1) can be appended to the end or beginning of p so that the neighboring digits are equal, if p exists; append prime(n+1) to the end of L_n, otherwise.
- Numbers of the form Sum_{j=1..k} sigma(j) that are square.A062407
Numbers of the form Sum_{j=1..k} sigma(j) that are square.
- Numbers k such that floor(Pi*k) is prime.A062408
Numbers k such that floor(Pi*k) is prime.
- Numbers k such that floor(e*k) is prime.A062409
Numbers k such that floor(e*k) is prime.
- Square spiral sequence: numbers are placed in a square spiral, a(1)=1, a(n) is found as the sum of the row (in the previous direction) a(n-1) is in.A062410
Square spiral sequence: numbers are placed in a square spiral, a(1)=1, a(n) is found as the sum of the row (in the previous direction) a(n-1) is in.