Sequences
392,541 sequences
- Sum of unitary, squarefree divisors of n, including 1.A092261
Sum of unitary, squarefree divisors of n, including 1.
- Primes p which equal prime(2^k) - prime(2^(k-1)) + 1 for some k.A092262
Primes p which equal prime(2^k) - prime(2^(k-1)) + 1 for some k.
- a(1)=1, a(n+1)=ceiling(phi*a(n))+1 if a(n) is odd, a(n+1)=ceiling(phi*a(n)) if a(n) is even, where phi=(1+sqrt(5))/2.A092263
a(1)=1, a(n+1)=ceiling(phi*a(n))+1 if a(n) is odd, a(n+1)=ceiling(phi*a(n)) if a(n) is even, where phi=(1+sqrt(5))/2.
- a(n)*a(n-5) = a(n-1)*a(n-4)+a(n-2)+a(n-3), with initial terms a(1) = ... = a(5) = 1.A092264
a(n)*a(n-5) = a(n-1)*a(n-4)+a(n-2)+a(n-3), with initial terms a(1) = ... = a(5) = 1.
- Sum of smallest parts of all partitions of n into distinct parts.A092265
Sum of smallest parts of all partitions of n into distinct parts.
- Expansion of (1+4x)/AGM(1+4x,1-4x) where AGM denotes the arithmetic-geometric mean.A092266
Expansion of (1+4x)/AGM(1+4x,1-4x) where AGM denotes the arithmetic-geometric mean.
- Values 2m_0+1 = 1, 2m_1, 2m_2+1, ... associated with divergent series T shown below.A092267
Values 2m_0+1 = 1, 2m_1, 2m_2+1, ... associated with divergent series T shown below.
- Total number of smallest parts in all partitions of n into odd parts.A092268
Total number of smallest parts in all partitions of n into odd parts.
- Spt function: total number of smallest parts (counted with multiplicity) in all partitions of n.A092269
Spt function: total number of smallest parts (counted with multiplicity) in all partitions of n.
- If n mod 2 == 0 then 3^n else 2^n.A092270
If n mod 2 == 0 then 3^n else 2^n.
- Triangle read by rows. First in a series of triangular arrays counting permutations of partitions.A092271
Triangle read by rows. First in a series of triangular arrays counting permutations of partitions.
- Numbers n such that phi(n) = phi(2*n+1).A092272
Numbers n such that phi(n) = phi(2*n+1).
- Positions where the partial sums of the series in A092324 (and A092267) changes sign.A092273
Positions where the partial sums of the series in A092324 (and A092267) changes sign.
- Sum_{k=2..n} min(k,n-k)*phi(k)*(n-k).A092274
Sum_{k=2..n} min(k,n-k)*phi(k)*(n-k).
- Draw a line through every pair of points with coordinates (x, 1) and (x', 2) with x, x' in 1..n, and then count the number of intersection points above the line y = 2.A092275
Draw a line through every pair of points with coordinates (x, 1) and (x', 2) with x, x' in 1..n, and then count the number of intersection points above the line y = 2.
- Triangle read by rows: T(n,k) is the number of noncrossing trees with root degree equal to k.A092276
Triangle read by rows: T(n,k) is the number of noncrossing trees with root degree equal to k.
- a(n) = 7*n^2 + n.A092277
a(n) = 7*n^2 + n.
- Floor( (3*n+4)/16 ).A092278
Floor( (3*n+4)/16 ).
- a(n) = floor(7*n/16) + 5.A092279
a(n) = floor(7*n/16) + 5.
- Partial sums of periods of reciprocals.A092280
Partial sums of periods of reciprocals.
- Period of reciprocal of the primorials.A092281
Period of reciprocal of the primorials.
- Difference between largest square number and largest cube number less than n.A092282
Difference between largest square number and largest cube number less than n.
- Triangular array read by rows: T(n,k)=n+k^2, 1<=k<=n.A092283
Triangular array read by rows: T(n,k)=n+k^2, 1<=k<=n.
- Number of nonterminal symbols in a certain "divide-and-conquer" context-free grammar in Chomsky normal form that generates all permutations of n symbols.A092284
Number of nonterminal symbols in a certain "divide-and-conquer" context-free grammar in Chomsky normal form that generates all permutations of n symbols.
- Number of productions of a certain "divide-and-conquer" context-free grammar in Chomsky normal form that generates all permutations of n symbols.A092285
Number of productions of a certain "divide-and-conquer" context-free grammar in Chomsky normal form that generates all permutations of n symbols.
- Fourth diagonal (m=3) of triangle A084938; a(n) = A084938(n+3,n) = (n^3 + 9*n^2 + 26*n)/6.A092286
Fourth diagonal (m=3) of triangle A084938; a(n) = A084938(n+3,n) = (n^3 + 9*n^2 + 26*n)/6.
- a(n) = Product_{j=1..n} Product_{k=1..n} gcd(j,k).A092287
a(n) = Product_{j=1..n} Product_{k=1..n} gcd(j,k).
- Triangle read by rows: T(n,k) = count of parts k in all plane partitions of n.A092288
Triangle read by rows: T(n,k) = count of parts k in all plane partitions of n.
- Number of triangles of partition numbers with the n-partition number as largest side.A092289
Number of triangles of partition numbers with the n-partition number as largest side.
- Decimal expansion of solution to n/x = x-n for n = 7.A092290
Decimal expansion of solution to n/x = x-n for n = 7.
- Let p = n-th irregular prime, A000928(n). Then a(n) = smallest value of m such that numerator(Bernoulli(2*m)/(2*m)) / numerator(Bernoulli(2*m)/(2*m*(2*m-1))) equals p.A092291
Let p = n-th irregular prime, A000928(n). Then a(n) = smallest value of m such that numerator(Bernoulli(2*m)/(2*m)) / numerator(Bernoulli(2*m)/(2*m*(2*m-1))) equals p.
- a(n) = 3*n + A053838(n).A092292
a(n) = 3*n + A053838(n).
- a(n) = 3*n + A090239(n).A092293
a(n) = 3*n + A090239(n).
- Decimal expansion of 3 + sqrt(15).A092294
Decimal expansion of 3 + sqrt(15).
- Number of partitions of n with even number (or 0) 2's.A092295
Number of partitions of n with even number (or 0) 2's.
- a(n) = 3*n + A090193(n).A092296
a(n) = 3*n + A090193(n).
- Number of ways of 3-coloring an annulus consisting of n zones joined like a pearl necklace.A092297
Number of ways of 3-coloring an annulus consisting of n zones joined like a pearl necklace.
- Number of partitions of the n-th prime into integers <= n.A092298
Number of partitions of the n-th prime into integers <= n.
- a(n) = 4*3^(n^2+2n+1)*Product_{j=1..n} (9^j-1).A092299
a(n) = 4*3^(n^2+2n+1)*Product_{j=1..n} (9^j-1).
- a(n) = 2*5^(n^2+2n+1)*Product_{j=1..n} (25^j-1).A092300
a(n) = 2*5^(n^2+2n+1)*Product_{j=1..n} (25^j-1).
- a(n) = 3^(n^2+2n+1)*Product_{j=1..n} (9^j-1).A092301
a(n) = 3^(n^2+2n+1)*Product_{j=1..n} (9^j-1).
- Delete all letters except c,d,i,l,m,u,v,x from n then read as Roman numeral if possible, otherwise 0.A092302
Delete all letters except c,d,i,l,m,u,v,x from n then read as Roman numeral if possible, otherwise 0.
- Triangle read by rows giving coefficients of polynomials f_n(q) arising in several different contexts.A092303
Triangle read by rows giving coefficients of polynomials f_n(q) arising in several different contexts.
- Number of cusped hyperbolic 3-manifolds obtained from n ideal tetrahedra.A092304
Number of cusped hyperbolic 3-manifolds obtained from n ideal tetrahedra.
- Length of period of sequence of Genocchi number of first kind read modulo (2n+1).A092305
Length of period of sequence of Genocchi number of first kind read modulo (2n+1).
- Number of partitions of n such that the set of parts has an even number of elements.A092306
Number of partitions of n such that the set of parts has an even number of elements.
- Primes p such that there are no primes q, 3 < q < p, such that (q-1) divides (p-1).A092307
Primes p such that there are no primes q, 3 < q < p, such that (q-1) divides (p-1).
- For p=prime(n), a(n) = the number of primes q such that q-1 divides p-1.A092308
For p=prime(n), a(n) = the number of primes q such that q-1 divides p-1.
- Sum of smallest parts (counted with multiplicity) of all partitions of n.A092309
Sum of smallest parts (counted with multiplicity) of all partitions of n.
- Sum of largest parts (counted with multiplicity) of all partitions of n into odd parts.A092310
Sum of largest parts (counted with multiplicity) of all partitions of n into odd parts.