Sequences
392,541 sequences
- Expansion of chi(x) / phi(x^2) in powers of x where phi(), chi() are Ramanujan theta functions.A085261
Expansion of chi(x) / phi(x^2) in powers of x where phi(), chi() are Ramanujan theta functions.
- Indices of nonzero terms of A085246, where a(n+2)=a(n+1)+A085246(n)+1 and a(2^(n-1)+1)=2^n.A085262
Indices of nonzero terms of A085246, where a(n+2)=a(n+1)+A085246(n)+1 and a(2^(n-1)+1)=2^n.
- Number of ways to write n as the sum of a squarefree number (A005117) and a positive square (A000290).A085263
Number of ways to write n as the sum of a squarefree number (A005117) and a positive square (A000290).
- Smallest number with exactly n representations as sum of a squarefree number (A005117) and a square (A000290).A085264
Smallest number with exactly n representations as sum of a squarefree number (A005117) and a square (A000290).
- Numbers that can be written as sum of a positive squarefree number and a positive square.A085265
Numbers that can be written as sum of a positive squarefree number and a positive square.
- Numbers having a unique representation as sum of a squarefree number and a square.A085266
Numbers having a unique representation as sum of a squarefree number and a square.
- Numbers having at least two representations as sum of a squarefree number and a nonzero square.A085267
Numbers having at least two representations as sum of a squarefree number and a nonzero square.
- Integer part of the conversion from Fahrenheit to Celsius.A085268
Integer part of the conversion from Fahrenheit to Celsius.
- Integer part of the conversion from centimeters to inches.A085269
Integer part of the conversion from centimeters to inches.
- Integer part of the conversion from miles to kilometers.A085270
Integer part of the conversion from miles to kilometers.
- Difference between n-th composite number and its smallest prime divisor.A085271
Difference between n-th composite number and its smallest prime divisor.
- a(n) = lcm_{k=1..n} (prime(k) + 1).A085272
a(n) = lcm_{k=1..n} (prime(k) + 1).
- Difference between n-th composite number and its largest prime divisor.A085273
Difference between n-th composite number and its largest prime divisor.
- Composite k such that (k!/k#) + 1 is a semiprime, where k# = primorial numbers A034386.A085274
Composite k such that (k!/k#) + 1 is a semiprime, where k# = primorial numbers A034386.
- Sum of n-th composite number and its largest prime divisor.A085275
Sum of n-th composite number and its largest prime divisor.
- Integer reached in A072340.A085276
Integer reached in A072340.
- Expansion of (1+x)^2/((1-2x)(1-3x)).A085277
Expansion of (1+x)^2/((1-2x)(1-3x)).
- Expansion of (1+2x)^2/((1-x^2)(1-2x)).A085278
Expansion of (1+2x)^2/((1-x^2)(1-2x)).
- Expansion of (1 - 2*x - 2*x^2)/((1 - 2*x)*(1 - 3*x)).A085279
Expansion of (1 - 2*x - 2*x^2)/((1 - 2*x)*(1 - 3*x)).
- Expansion of (1-4x+x^2)/((1-x)(1-3x)(1-4x)).A085280
Expansion of (1-4x+x^2)/((1-x)(1-3x)(1-4x)).
- Expansion of (1 - 3*x + x^2)/((1-2*x)*(1-3*x)).A085281
Expansion of (1 - 3*x + x^2)/((1-2*x)*(1-3*x)).
- Expansion of (1 - 5*x + 5*x^2)/((1-x)*(1-3*x)*(1-4*x)).A085282
Expansion of (1 - 5*x + 5*x^2)/((1-x)*(1-3*x)*(1-4*x)).
- a(n) = n*n^n - (n-1)*(n-1)^n.A085283
a(n) = n*n^n - (n-1)*(n-1)^n.
- a(n) = C(n+3,3)*n^3/4.A085284
a(n) = C(n+3,3)*n^3/4.
- Positions where records occur in A072340.A085285
Positions where records occur in A072340.
- Record values in A072340.A085286
Record values in A072340.
- Expansion of g.f. (1+4*x)/((1-x)*(1+x)*(1-3*x)).A085287
Expansion of g.f. (1+4*x)/((1-x)*(1+x)*(1-3*x)).
- Number of sorted multiplicative partitions of n!.A085288
Number of sorted multiplicative partitions of n!.
- Number of sorted multiplicative partitions of n! of length n.A085289
Number of sorted multiplicative partitions of n! of length n.
- Max[p1^b1] over all sorted multiplicative partitions of n! of length n.A085290
Max[p1^b1] over all sorted multiplicative partitions of n! of length n.
- Decimal expansion of Alladi-Grinstead constant exp(c-1), where c is given in A085361.A085291
Decimal expansion of Alladi-Grinstead constant exp(c-1), where c is given in A085361.
- Product of Lucas (A000204) and a Pell companion series (A001333).A085292
Product of Lucas (A000204) and a Pell companion series (A001333).
- Product of Lucas (A000204) and a Pell Companion series (A002203).A085293
Product of Lucas (A000204) and a Pell Companion series (A002203).
- Integer ceiling of coefficients of exp(x*A(x)).A085294
Integer ceiling of coefficients of exp(x*A(x)).
- E.g.f. satisfies exp(x*Sum_{n>=0} ceiling(a(n)/n!)*x^n) = Sum_{n>=0} a(n)*x^n/n!.A085295
E.g.f. satisfies exp(x*Sum_{n>=0} ceiling(a(n)/n!)*x^n) = Sum_{n>=0} a(n)*x^n/n!.
- Runs of zeros in Catalan sequence modulo 3: consecutive occurrences of binomial(2*k,k)/(k+1) == 0 (mod 3).A085296
Runs of zeros in Catalan sequence modulo 3: consecutive occurrences of binomial(2*k,k)/(k+1) == 0 (mod 3).
- Nonzero residues of Catalan sequence modulo 3; related to the Thue-Morse sequence (A001285).A085297
Nonzero residues of Catalan sequence modulo 3; related to the Thue-Morse sequence (A001285).
- a(n) is the smallest exponent x such that prime(n)^x when reversed is a prime.A085298
a(n) is the smallest exponent x such that prime(n)^x when reversed is a prime.
- a(n) is the smallest number x such that A085298[x]=n, or 0 if no such number exists.A085299
a(n) is the smallest number x such that A085298[x]=n, or 0 if no such number exists.
- a(n) is the least prime x such that when reversed it is a power of prime(n).A085300
a(n) is the least prime x such that when reversed it is a power of prime(n).
- Number of factorials between two primorials.A085301
Number of factorials between two primorials.
- a(n) is the partial sum of A085301(j) from j=1 to n; a(n)-1 shows the number of factorials below n-th primorial.A085302
a(n) is the partial sum of A085301(j) from j=1 to n; a(n)-1 shows the number of factorials below n-th primorial.
- Positions of 2 in A085301.A085303
Positions of 2 in A085301.
- Least number of 4th powers required to represent n!.A085304
Least number of 4th powers required to represent n!.
- Numbers such that first reversing digits and then squaring equals the result of first squaring and then reversing.A085305
Numbers such that first reversing digits and then squaring equals the result of first squaring and then reversing.
- Prime numbers such that first reversing digits and after squaring equals the result of first-squaring and after-reversing. Primes in A085305.A085306
Prime numbers such that first reversing digits and after squaring equals the result of first-squaring and after-reversing. Primes in A085305.
- a(1) = 1; for n > 1, concatenate distinct prime factors of n in decreasing order.A085307
a(1) = 1; for n > 1, concatenate distinct prime factors of n in decreasing order.
- Iterate function described in A085308 (= reverse concatenation of prime factors); a(n) is either 1# the fixed point[=prime] if it exists at all: 2# a(2k)=1 labels that no convergence with most even initial values, in contrary mostly rapid divergence is the case; 3# a(n)=0 if n=1 or if the iteration results in nontrivial attractor with cycle length larger than one.A085308
Iterate function described in A085308 (= reverse concatenation of prime factors); a(n) is either 1# the fixed point[=prime] if it exists at all: 2# a(2k)=1 labels that no convergence with most even initial values, in contrary mostly rapid divergence is the case; 3# a(n)=0 if n=1 or if the iteration results in nontrivial attractor with cycle length larger than one.
- Initial values providing nontrivial cyclic attractor when function defined in A085307 is iterated.A085309
Initial values providing nontrivial cyclic attractor when function defined in A085307 is iterated.
- Number of distinct 7th powers modulo n.A085310
Number of distinct 7th powers modulo n.