Sequences
392,541 sequences
- a(1) = 4; a(n) = least number such that the concatenation a(n)a(n-1)...a(2)a(1) is a square.A061361
a(1) = 4; a(n) = least number such that the concatenation a(n)a(n-1)...a(2)a(1) is a square.
- Numbers in which each nonzero digit divides the number formed by the rest, i.e., the number obtained by just removing this digit.A061362
Numbers in which each nonzero digit divides the number formed by the rest, i.e., the number obtained by just removing this digit.
- a(1) = 9; a(n) = least number such that the concatenation a(n)a(n-1)...a(2)a(1) is a square.A061363
a(1) = 9; a(n) = least number such that the concatenation a(n)a(n-1)...a(2)a(1) is a square.
- Pseudo-random numbers: a (very weak) pseudo-random number generator from the second edition of the C book.A061364
Pseudo-random numbers: a (very weak) pseudo-random number generator from the second edition of the C book.
- Numbers k such that either k or its reversal (but not both) is prime.A061365
Numbers k such that either k or its reversal (but not both) is prime.
- Numbers k such that phi(k)+sigma(k) is a perfect cube.A061366
Numbers k such that phi(k)+sigma(k) is a perfect cube.
- Composite n such that sigma(n)-phi(n) divides sigma(n)+phi(n).A061367
Composite n such that sigma(n)-phi(n) divides sigma(n)+phi(n).
- Lesser of twin primes (p, p+2) whose average p+1 is not squarefree.A061368
Lesser of twin primes (p, p+2) whose average p+1 is not squarefree.
- a(n) = smallest square in the arithmetic progression {n*k+1 : k > 0}.A061369
a(n) = smallest square in the arithmetic progression {n*k+1 : k > 0}.
- a(n) = floor(ratio of product and sum of first n numbers).A061370
a(n) = floor(ratio of product and sum of first n numbers).
- Composite numbers with all prime digits.A061371
Composite numbers with all prime digits.
- Primes having only 0,4,6,8,9 as digits.A061372
Primes having only 0,4,6,8,9 as digits.
- "Natural" logarithm, defined inductively by a(1)=1, a(p) = 1 + a(p-1) if p is prime and a(n*m) = a(n) + a(m) if n, m>1.A061373
"Natural" logarithm, defined inductively by a(1)=1, a(p) = 1 + a(p-1) if p is prime and a(n*m) = a(n) + a(m) if n, m>1.
- Numbers which have more different digits than their cubes.A061374
Numbers which have more different digits than their cubes.
- Integer part of geometric mean of first n positive integers.A061375
Integer part of geometric mean of first n positive integers.
- a(n) = f(n) + f(f(n)) where f(n) = 0 if n <= 1 or a prime, otherwise f(n) = sum of distinct primes dividing n.A061376
a(n) = f(n) + f(f(n)) where f(n) = 0 if n <= 1 or a prime, otherwise f(n) = sum of distinct primes dividing n.
- a(1) = 1, a(n+1) = numerator of the continued fraction [1; 2, 4, 8, ..., 2^n].A061377
a(1) = 1, a(n+1) = numerator of the continued fraction [1; 2, 4, 8, ..., 2^n].
- Product of all numbers formed by permuting the digits of n.A061378
Product of all numbers formed by permuting the digits of n.
- Difference between n and its reversal is a perfect cube.A061379
Difference between n and its reversal is a perfect cube.
- Triangular numbers with product of digits also a triangular number.A061380
Triangular numbers with product of digits also a triangular number.
- Smallest "inconsummate number" in base n greater than in the previous base.A061381
Smallest "inconsummate number" in base n greater than in the previous base.
- Decimal expansion of Pi/e.A061382
Decimal expansion of Pi/e.
- Arithmetic mean of digits is an integer.A061383
Arithmetic mean of digits is an integer.
- Numbers n such that sum of digits = number of digits.A061384
Numbers n such that sum of digits = number of digits.
- Numbers n such that sum of digits = twice number of digits.A061385
Numbers n such that sum of digits = twice number of digits.
- Sum of digits = 3 times number of digits.A061386
Sum of digits = 3 times number of digits.
- Sum of digits = 4 times number of digits.A061387
Sum of digits = 4 times number of digits.
- Sum of digits = 5 times number of digits.A061388
Sum of digits = 5 times number of digits.
- Number of (1+phi)-divisors of n.A061389
Number of (1+phi)-divisors of n.
- Use same rules as A047988. Sequence gives smallest numbers which require n steps to reach 2.A061390
Use same rules as A047988. Sequence gives smallest numbers which require n steps to reach 2.
- a(n) = t(n,3) = Sum_{d|n} tau(d^3), where tau(n) = number of divisors of n, cf. A000005.A061391
a(n) = t(n,3) = Sum_{d|n} tau(d^3), where tau(n) = number of divisors of n, cf. A000005.
- a(n) = a(floor(n/3)) + a(ceiling(n/3)) with a(0) = 0 and a(1) = 1.A061392
a(n) = a(floor(n/3)) + a(ceiling(n/3)) with a(0) = 0 and a(1) = 1.
- Number of appearances of n in sequence defined by b(k) = b(floor(k/3)) + b(ceiling(k/3)) with b(0)=0 and b(1)=1, i.e., in A061392.A061393
Number of appearances of n in sequence defined by b(k) = b(floor(k/3)) + b(ceiling(k/3)) with b(0)=0 and b(1)=1, i.e., in A061392.
- Number of distinct prime factors of n-th least prime signature (A025487); also a(n)-th prime is largest prime factor of n-th least prime signature; also a(n)-th primorial number is largest primorial factor of n-th least product of primorial numbers.A061394
Number of distinct prime factors of n-th least prime signature (A025487); also a(n)-th prime is largest prime factor of n-th least prime signature; also a(n)-th primorial number is largest primorial factor of n-th least product of primorial numbers.
- Let p be the largest prime factor of n; if p is the k-th prime then set a(n) = k; a(1) = 0 by convention.A061395
Let p be the largest prime factor of n; if p is the k-th prime then set a(n) = k; a(1) = 0 by convention.
- Number of "rooted index-functional forests" (Riffs) on n nodes. Number of "rooted odd trees with only exponent symmetries" (Rotes) on 2n+1 nodes.A061396
Number of "rooted index-functional forests" (Riffs) on n nodes. Number of "rooted odd trees with only exponent symmetries" (Rotes) on 2n+1 nodes.
- Characteristic function sequence of primes multiplied componentwise by N, the natural numbers.A061397
Characteristic function sequence of primes multiplied componentwise by N, the natural numbers.
- Number of squarefree integers between prime(n) and prime(n+1).A061398
Number of squarefree integers between prime(n) and prime(n+1).
- Number of nonsquarefree integers between primes prime(n) and prime(n+1).A061399
Number of nonsquarefree integers between primes prime(n) and prime(n+1).
- Primes p such that there is no squarefree number between p and the next prime.A061400
Primes p such that there is no squarefree number between p and the next prime.
- From solution to a Picard-Fuchs equation.A061401
From solution to a Picard-Fuchs equation.
- a(n) = floor(n*sqrt(e)).A061402
a(n) = floor(n*sqrt(e)).
- Denominators in the series for Bessel function J4(x).A061403
Denominators in the series for Bessel function J4(x).
- Denominators in the series for Bessel function J5(x).A061404
Denominators in the series for Bessel function J5(x).
- Denominators in the series for Bessel function J6(x).A061405
Denominators in the series for Bessel function J6(x).
- Denominators in the series for Bessel function J7(x).A061406
Denominators in the series for Bessel function J7(x).
- Denominators in the series for Bessel function J8(x).A061407
Denominators in the series for Bessel function J8(x).
- For each y >= 1 there are only finitely many values of x >= 1 such that x-y and x+y are both positive squares; list all such pairs (x,y) ordered by values of y; sequence gives y values.A061408
For each y >= 1 there are only finitely many values of x >= 1 such that x-y and x+y are both positive squares; list all such pairs (x,y) ordered by values of y; sequence gives y values.
- For each y >= 1 there are only finitely many values of x >= 1 such that x-y and x+y are both positive squares; list all such pairs (x,y) ordered by values of y; sequence gives x values.A061409
For each y >= 1 there are only finitely many values of x >= 1 such that x-y and x+y are both positive squares; list all such pairs (x,y) ordered by values of y; sequence gives x values.
- Numbers k such that m*2^k+1 is not prime for all coefficients m in the range 0<=m<=k.A061410
Numbers k such that m*2^k+1 is not prime for all coefficients m in the range 0<=m<=k.