Sequences
392,541 sequences
- Numbers n such that sigma(n+1)=3*phi(n).A067261
Numbers n such that sigma(n+1)=3*phi(n).
- Numbers k such that sigma(k+1) = 4*phi(k).A067262
Numbers k such that sigma(k+1) = 4*phi(k).
- Numbers k such that sigma(k+1) = 5*phi(k).A067263
Numbers k such that sigma(k+1) = 5*phi(k).
- Numbers n such that prime(n+1)-prime(n)=bigomega(n).A067264
Numbers n such that prime(n+1)-prime(n)=bigomega(n).
- Numbers n such that prime(n+1) - prime(n) = M(n) where M(n) is the Mertens function A002321(n).A067265
Numbers n such that prime(n+1) - prime(n) = M(n) where M(n) is the Mertens function A002321(n).
- Numbers n such that omega(n)=M(n) where omega(n) is A001221(n) and M(n) is the Mertens function A002321(n).A067266
Numbers n such that omega(n)=M(n) where omega(n) is A001221(n) and M(n) is the Mertens function A002321(n).
- Numbers n such that n, 10*n+1, 10*n+3, 10*n+7 and 10*n+9 are all primes.A067267
Numbers n such that n, 10*n+1, 10*n+3, 10*n+7 and 10*n+9 are all primes.
- Numbers k such that k and k^2+1 have the same number of distinct prime factors.A067268
Numbers k such that k and k^2+1 have the same number of distinct prime factors.
- Triangular numbers which remain triangular when the most significant digit is moved to the end.A067269
Triangular numbers which remain triangular when the most significant digit is moved to the end.
- Numbers m such that m-th triangular number (A000217) ends in m.A067270
Numbers m such that m-th triangular number (A000217) ends in m.
- Numbers n such that the digits of P_7(n), the n-th heptagonal number, end in n.A067271
Numbers n such that the digits of P_7(n), the n-th heptagonal number, end in n.
- a(n) = 2*10^(n-1) - 1.A067272
a(n) = 2*10^(n-1) - 1.
- a(n) = n*(a(n-1)*2+1), a(0) = 0.A067273
a(n) = n*(a(n-1)*2+1), a(0) = 0.
- Number of ordered integer pairs (b,c), with -n<=b<=n, -n<=c<=n, such that both roots of x^2+bx+c=0 are integers.A067274
Number of ordered integer pairs (b,c), with -n<=b<=n, -n<=c<=n, such that both roots of x^2+bx+c=0 are integers.
- Number of Fibonacci numbers A000045(k), k <= 10^n, which end in 4.A067275
Number of Fibonacci numbers A000045(k), k <= 10^n, which end in 4.
- Determinant of n X n matrix containing the first n^2 primes in increasing order.A067276
Determinant of n X n matrix containing the first n^2 primes in increasing order.
- Factorial expansion of zeta(3): zeta(3) = Sum_{n>=1} a(n)/n!.A067277
Factorial expansion of zeta(3): zeta(3) = Sum_{n>=1} a(n)/n!.
- a(n) = letters(n) + a(n-1); a(0) = 0.A067278
a(n) = letters(n) + a(n-1); a(0) = 0.
- Factorial expansion of zeta(2) : zeta(2) = Sum_{n>=1} a(n)/n!.A067279
Factorial expansion of zeta(2) : zeta(2) = Sum_{n>=1} a(n)/n!.
- Number of terms in continued fraction for sqrt(n), excl. 2nd and higher periods.A067280
Number of terms in continued fraction for sqrt(n), excl. 2nd and higher periods.
- Number of permutations of {1,2,3,...,n} where the elements of n are considered indistinguishable if they differ by a power of 2 (for example 3, 12 and 24 are all considered equivalent).A067281
Number of permutations of {1,2,3,...,n} where the elements of n are considered indistinguishable if they differ by a power of 2 (for example 3, 12 and 24 are all considered equivalent).
- Numbers k such that phi(k) + phi(k+1) divides sigma(k) + sigma(k+1).A067282
Numbers k such that phi(k) + phi(k+1) divides sigma(k) + sigma(k+1).
- Numbers n such that the number of divisors of n is floor(log(n)).A067283
Numbers n such that the number of divisors of n is floor(log(n)).
- a(n) = number of integers k such that k is not of the form m + reverse(m) for any m (cf. A067031) and A067030(n) occurs in the 'Reverse and Add' trajectory of k.A067284
a(n) = number of integers k such that k is not of the form m + reverse(m) for any m (cf. A067031) and A067030(n) occurs in the 'Reverse and Add' trajectory of k.
- a(n) = smallest integer k such that k is not of the form m + reverse(m) for any m (cf. A067031) and A067030(n) occurs in the 'Reverse and Add' trajectory of k.A067285
a(n) = smallest integer k such that k is not of the form m + reverse(m) for any m (cf. A067031) and A067030(n) occurs in the 'Reverse and Add' trajectory of k.
- a(n) = largest integer k such that k is not of the form m + reverse(m) for any m (cf. A067031) and A067030(n) occurs in the 'Reverse and Add' trajectory of k.A067286
a(n) = largest integer k such that k is not of the form m + reverse(m) for any m (cf. A067031) and A067030(n) occurs in the 'Reverse and Add' trajectory of k.
- n sets a new record for the number of integers k such that k is not of the form m + reverse(m) for any m and n occurs in the 'Reverse and Add' trajectory of k (cf. A067284).A067287
n sets a new record for the number of integers k such that k is not of the form m + reverse(m) for any m and n occurs in the 'Reverse and Add' trajectory of k (cf. A067284).
- Records for the number of integers k such that k is not of the form m + reverse(m) for any m and for some n A067030(n) occurs in the 'Reverse and Add' trajectory of k (cf. A067284).A067288
Records for the number of integers k such that k is not of the form m + reverse(m) for any m and for some n A067030(n) occurs in the 'Reverse and Add' trajectory of k (cf. A067284).
- Numbers k such that the number of divisors of k is floor(prime(k)/k).A067289
Numbers k such that the number of divisors of k is floor(prime(k)/k).
- Numbers n such that prime(n)<n*tau(n) where tau(n) is the number of divisors of n.A067290
Numbers n such that prime(n)<n*tau(n) where tau(n) is the number of divisors of n.
- Numbers n such that prime(n)>n*tau(n) where tau(n) is the number of divisors of n.A067291
Numbers n such that prime(n)>n*tau(n) where tau(n) is the number of divisors of n.
- a(n) = prime(n)-n*tau(n) where tau(n) is the number of divisors of n.A067292
a(n) = prime(n)-n*tau(n) where tau(n) is the number of divisors of n.
- Numbers k such that prime(k+1)-(k+1)*tau(k+1) = prime(k)-k*tau(k) where tau(k) = A000005(k) is the number of divisors of k.A067293
Numbers k such that prime(k+1)-(k+1)*tau(k+1) = prime(k)-k*tau(k) where tau(k) = A000005(k) is the number of divisors of k.
- Third column of triangle A028364.A067294
Third column of triangle A028364.
- Fourth column of triangle A028364.A067295
Fourth column of triangle A028364.
- Fifth column of triangle A028364.A067296
Fifth column of triangle A028364.
- Convolution of C(2,2; n) := A064340(n) (generalized Catalan numbers) with itself.A067297
Convolution of C(2,2; n) := A064340(n) (generalized Catalan numbers) with itself.
- Generalized Catalan triangle, based on C(2,2; n) = A064340(n).A067298
Generalized Catalan triangle, based on C(2,2; n) = A064340(n).
- Second column of triangle A067298.A067299
Second column of triangle A067298.
- One third of third column of triangle A067298.A067300
One third of third column of triangle A067298.
- One eighth of fourth column of triangle A067298.A067301
One eighth of fourth column of triangle A067298.
- Row sums of triangle A067298 and of A067304.A067302
Row sums of triangle A067298 and of A067304.
- Even-indexed members of A067302.A067303
Even-indexed members of A067302.
- Generalized Catalan triangle A067298 with row reversion.A067304
Generalized Catalan triangle A067298 with row reversion.
- Second column of triangle A067304.A067305
Second column of triangle A067304.
- One-fourth of third column of triangle A067304.A067306
One-fourth of third column of triangle A067304.
- One-fourth of fourth column of triangle A067304.A067307
One-fourth of fourth column of triangle A067304.
- One sixteenth of fifth column of triangle A067304.A067308
One sixteenth of fifth column of triangle A067304.
- Number of symmetric unlabeled digraphs (unlabeled digraphs with nontrivial automorphism group).A067309
Number of symmetric unlabeled digraphs (unlabeled digraphs with nontrivial automorphism group).
- Square table read by antidiagonals of number of ways of arranging n chords on a circle with k simple intersections (i.e., no intersections with 3 or more chords).A067310
Square table read by antidiagonals of number of ways of arranging n chords on a circle with k simple intersections (i.e., no intersections with 3 or more chords).