Sequences
392,541 sequences
- Primes p such that q = (p^2 + 1)/2 is also a prime.A048161
Primes p such that q = (p^2 + 1)/2 is also a prime.
- Expansion of (1 - x + 3*x^3 - 2*x^4 - 3*x^5)/(1 - 2*x + x^3).A048162
Expansion of (1 - x + 3*x^3 - 2*x^4 - 3*x^5)/(1 - 2*x + x^3).
- a(n) = Sum_{k=1..n} ((k-1)!)^2*Stirling2(n,k)^2.A048163
a(n) = Sum_{k=1..n} ((k-1)!)^2*Stirling2(n,k)^2.
- a(0)=1, a(n+1)=1+(2^(2^n)+1)*a(n).A048164
a(0)=1, a(n+1)=1+(2^(2^n)+1)*a(n).
- Expansion of Product_{k > 0} 1/(1 + x^prime(k)).A048165
Expansion of Product_{k > 0} 1/(1 + x^prime(k)).
- Numbers k that are divisible by the number of unitary divisors of k (A034444).A048166
Numbers k that are divisible by the number of unitary divisors of k (A034444).
- Integer quotients of numbers k divisible by the number of unitary divisors of k (A034444).A048167
Integer quotients of numbers k divisible by the number of unitary divisors of k (A034444).
- n is divisible by the square of the number of unitary divisors of n (A034444).A048168
n is divisible by the square of the number of unitary divisors of n (A034444).
- n is divisible by the cube of the number of unitary divisors of n (A034444).A048169
n is divisible by the cube of the number of unitary divisors of n (A034444).
- n is divisible by the 4th power of the number of unitary divisors of n (A034444).A048170
n is divisible by the 4th power of the number of unitary divisors of n (A034444).
- Erroneous version of A090178.A048171
Erroneous version of A090178.
- Number of labeled series-parallel graphs with n edges.A048172
Number of labeled series-parallel graphs with n edges.
- Duplicate of A058349.A048173
Duplicate of A058349.
- Number of labeled chains with n edges.A048174
Number of labeled chains with n edges.
- Size of range 1..m generatable from the digits of an n-digit integer and + - x /.A048175
Size of range 1..m generatable from the digits of an n-digit integer and + - x /.
- Generalized Stirling number triangle of first kind.A048176
Generalized Stirling number triangle of first kind.
- Primes p = d_1 d_2 ... d_k in base 10 such that for some base b, p = Sum_{i = 1..k} b^d_i.A048177
Primes p = d_1 d_2 ... d_k in base 10 such that for some base b, p = Sum_{i = 1..k} b^d_i.
- Bases b associated with A048177.A048178
Bases b associated with A048177.
- Number of graphs with n nodes and n+1 edges.A048179
Number of graphs with n nodes and n+1 edges.
- Number of graphs with n nodes and n+2 edges.A048180
Number of graphs with n nodes and n+2 edges.
- Chisel strokes in Runes numerals (= alphabet characters).A048181
Chisel strokes in Runes numerals (= alphabet characters).
- Variation on A047988, where division by d costs d points instead of 0 points.A048182
Variation on A047988, where division by d costs d points instead of 0 points.
- Least inverse of A048182.A048183
Least inverse of A048182.
- Primes with nontrivial omnipower group.A048184
Primes with nontrivial omnipower group.
- Least nontrivial omnipower mod A048184(n).A048185
Least nontrivial omnipower mod A048184(n).
- Order of omnipower group mod A048184(n).A048186
Order of omnipower group mod A048184(n).
- Palindromic untouchable numbers.A048187
Palindromic untouchable numbers.
- a(n) = phi(n-th untouchable number).A048188
a(n) = phi(n-th untouchable number).
- Let (u1,u2) be successive untouchable numbers such that phi(u1) = phi(u2); sequence gives values of u1.A048189
Let (u1,u2) be successive untouchable numbers such that phi(u1) = phi(u2); sequence gives values of u1.
- Let (u1,u2) be successive untouchable numbers such that phi(u1) = phi(u2); sequence gives values of u2.A048190
Let (u1,u2) be successive untouchable numbers such that phi(u1) = phi(u2); sequence gives values of u2.
- Let (u1,u2) be successive untouchable numbers such that phi(u1) = phi(u2) = k; sequence gives values of k.A048191
Let (u1,u2) be successive untouchable numbers such that phi(u1) = phi(u2) = k; sequence gives values of k.
- Number of connected chordal graphs on n vertices.A048192
Number of connected chordal graphs on n vertices.
- Number of chordal graphs (or triangulated graphs) on n vertices.A048193
Number of chordal graphs (or triangulated graphs) on n vertices.
- Total number of split graphs (chordal + chordal complement) on n vertices.A048194
Total number of split graphs (chordal + chordal complement) on n vertices.
- Numbers k for which binomial(k, floor(k/2)) has fewer unitary than non-unitary divisors.A048195
Numbers k for which binomial(k, floor(k/2)) has fewer unitary than non-unitary divisors.
- Numbers k for which binomial(k, floor(k/2)) has the same number of unitary and non-unitary divisors.A048196
Numbers k for which binomial(k, floor(k/2)) has the same number of unitary and non-unitary divisors.
- Numbers k for which binomial(k, floor(k/2)) has more unitary than non-unitary divisors.A048197
Numbers k for which binomial(k, floor(k/2)) has more unitary than non-unitary divisors.
- Number of primes between successive n's, where n mod 10 = 5.A048198
Number of primes between successive n's, where n mod 10 = 5.
- Distance of primes to next odd multiple of 5 (where n mod 10 = 5).A048199
Distance of primes to next odd multiple of 5 (where n mod 10 = 5).
- Minimal length pair-exchange / set-rotate sequence to reverse n distinct ordered elements.A048200
Minimal length pair-exchange / set-rotate sequence to reverse n distinct ordered elements.
- Triangular array T read by rows: T(i,j)=b(i+1)-b(i+1-j); j=1,2,...,i; i=1,2,3,...; b=A004978.A048201
Triangular array T read by rows: T(i,j)=b(i+1)-b(i+1-j); j=1,2,...,i; i=1,2,3,...; b=A004978.
- a(n)=T(n,2), array T given by A048201.A048202
a(n)=T(n,2), array T given by A048201.
- a(n)=T(n,3), array T given by A048201.A048203
a(n)=T(n,3), array T given by A048201.
- a(n) = T(n+1,n), array T given by A048201.A048204
a(n) = T(n+1,n), array T given by A048201.
- a(n)=T(n+2,n), array T given by A048201.A048205
a(n)=T(n+2,n), array T given by A048201.
- a(n)=least m such that row m of T contains n, array T given by A048201.A048206
a(n)=least m such that row m of T contains n, array T given by A048201.
- a(n)=least m such that column m of T that contains n, array T given by A048201.A048207
a(n)=least m such that column m of T that contains n, array T given by A048201.
- a(n) = T(2n-1,n), array T given by A048201.A048208
a(n) = T(2n-1,n), array T given by A048201.
- a(n)=Sum{T(n,j): j=1,2,...,n}, array T given by A048201.A048209
a(n)=Sum{T(n,j): j=1,2,...,n}, array T given by A048201.
- T(n,1) + T(n,n), array T given by A048201.A048210
T(n,1) + T(n,n), array T given by A048201.