Sequences
392,541 sequences
- Numbers k such that sigma(k) == 1 (mod 4).A072461
Numbers k such that sigma(k) == 1 (mod 4).
- Numbers k such that sigma(k) == 3 (mod 4).A072462
Numbers k such that sigma(k) == 3 (mod 4).
- Shadow transform of sigma(n), A000203, starting with 0, sigma(1), sigma(2), ...A072463
Shadow transform of sigma(n), A000203, starting with 0, sigma(1), sigma(2), ...
- Code word lengths for non-redundant MML code for positive integers.A072464
Code word lengths for non-redundant MML code for positive integers.
- A Fibonacci-like model in which each pair of rabbits dies after the birth of their 4th litter: a(n) = a(n-2) + a(n-3) + a(n-4) + a(n-5).A072465
A Fibonacci-like model in which each pair of rabbits dies after the birth of their 4th litter: a(n) = a(n-2) + a(n-3) + a(n-4) + a(n-5).
- Numbers with 11 odd integers in their Collatz (or 3x+1) trajectory.A072466
Numbers with 11 odd integers in their Collatz (or 3x+1) trajectory.
- Triangle in which n-th row contains n primes == 1 mod (n) and the first term of a row is just greater than the last term of the previous row.A072467
Triangle in which n-th row contains n primes == 1 mod (n) and the first term of a row is just greater than the last term of the previous row.
- Leading diagonal of triangle in A072467.A072468
Leading diagonal of triangle in A072467.
- Right diagonal of triangle in A072467.A072469
Right diagonal of triangle in A072467.
- a(0) = 0, a(1) = 9; for n > 1 a(n) = smallest positive square (possibly required to be greater than a(n-1)?) such that a(0) + a(1) + ... + a(n) is a square.A072470
a(0) = 0, a(1) = 9; for n > 1 a(n) = smallest positive square (possibly required to be greater than a(n-1)?) such that a(0) + a(1) + ... + a(n) is a square.
- Squares such that the sum of two neighboring term is also a square.A072471
Squares such that the sum of two neighboring term is also a square.
- a(n) = product of numbers from prime(n)+1 up to prime(n+1), where prime(n) is the n-th prime.A072472
a(n) = product of numbers from prime(n)+1 up to prime(n+1), where prime(n) is the n-th prime.
- a(n) = prime(2*n) - prime(n).A072473
a(n) = prime(2*n) - prime(n).
- Sum of next n squares.A072474
Sum of next n squares.
- Sum of next n composite numbers.A072475
Sum of next n composite numbers.
- Difference between the sum of first n prime numbers and the sum of first n composite numbers.A072476
Difference between the sum of first n prime numbers and the sum of first n composite numbers.
- a(n) = (2*n)!*binomial(2*n,n)/8.A072477
a(n) = (2*n)!*binomial(2*n,n)/8.
- Surface area of n-dimensional sphere of radius r is n*V_n*r^(n-1) = n*Pi^(n/2)*r^(n-1)/(n/2)! = S_n*Pi^floor(n/2)*r^(n-1); sequence gives numerator of S_n.A072478
Surface area of n-dimensional sphere of radius r is n*V_n*r^(n-1) = n*Pi^(n/2)*r^(n-1)/(n/2)! = S_n*Pi^floor(n/2)*r^(n-1); sequence gives numerator of S_n.
- Surface area of n-dimensional sphere of radius r is n*V_n*r^(n-1) = n*Pi^(n/2)*r^(n-1)/(n/2)! = S_n*Pi^floor(n/2)*r^(n-1); sequence gives denominator of S_n.A072479
Surface area of n-dimensional sphere of radius r is n*V_n*r^(n-1) = n*Pi^(n/2)*r^(n-1)/(n/2)! = S_n*Pi^floor(n/2)*r^(n-1); sequence gives denominator of S_n.
- Shadow transform of factorials A000142.A072480
Shadow transform of factorials A000142.
- a(n) = Sum_{k=1..n} Sum_{d=1..k} (k mod d).A072481
a(n) = Sum_{k=1..n} Sum_{d=1..k} (k mod d).
- Partition the nonnegative integers into minimal groups whose sums are palindromes; this sequence gives the sums.A072482
Partition the nonnegative integers into minimal groups whose sums are palindromes; this sequence gives the sums.
- Triangle read by rows: The n-th row contains the smallest n increasing numbers larger than the last term of the previous row, which contain the string of digits of n.A072483
Triangle read by rows: The n-th row contains the smallest n increasing numbers larger than the last term of the previous row, which contain the string of digits of n.
- Triangle in which the n-th row contains the n smallest numbers containing the string of digits of n in increasing order.A072484
Triangle in which the n-th row contains the n smallest numbers containing the string of digits of n in increasing order.
- n-th number that includes the substring [n] in its decimal expansion.A072485
n-th number that includes the substring [n] in its decimal expansion.
- a(1) = 1, a(n) = a(n-1) times smallest prime factor of n.A072486
a(1) = 1, a(n) = a(n-1) times smallest prime factor of n.
- a(1) = 1, a(n) = a(n-1) times largest nontrivial divisor if n is composite.A072487
a(1) = 1, a(n) = a(n-1) times largest nontrivial divisor if n is composite.
- a(1) = 1, a(n) = a(n-1) times largest divisor of n <= n^(1/2).A072488
a(1) = 1, a(n) = a(n-1) times largest divisor of n <= n^(1/2).
- a(1) = 1, a(n) = a(n-1) times smallest divisor of n >= n^(1/2).A072489
a(1) = 1, a(n) = a(n-1) times smallest divisor of n >= n^(1/2).
- Number of squarefree numbers (excluding 1) less than n.A072490
Number of squarefree numbers (excluding 1) less than n.
- Define f(1) = 0. For n>=2, let f(n) = n - p where p is the largest prime <= n. a(n) = number of iterations of f to reach 0, starting from n.A072491
Define f(1) = 0. For n>=2, let f(n) = n - p where p is the largest prime <= n. a(n) = number of iterations of f to reach 0, starting from n.
- Values of n for which A072491(n)=3.A072492
Values of n for which A072491(n)=3.
- a(1) = 1 and a(n) = ceiling((Sum_{k=1..n-1} a(k))/3) for n >= 2.A072493
a(1) = 1 and a(n) = ceiling((Sum_{k=1..n-1} a(k))/3) for n >= 2.
- First of triples of consecutive happy numbers, i.e., the first of three consecutive integers each of which is a happy number (A007770).A072494
First of triples of consecutive happy numbers, i.e., the first of three consecutive integers each of which is a happy number (A007770).
- Automorphic numbers: numbers k such that k^21 ends with k. Also m-morphic numbers for any m such that (m-1)/10 is an even integer not divisible by 10.A072495
Automorphic numbers: numbers k such that k^21 ends with k. Also m-morphic numbers for any m such that (m-1)/10 is an even integer not divisible by 10.
- k-morphic numbers for any k such that (k-1)/10 is an odd integer not divisible by 5.A072496
k-morphic numbers for any k such that (k-1)/10 is an odd integer not divisible by 5.
- Numbers k such that k^2 is a member of A072498.A072497
Numbers k such that k^2 is a member of A072498.
- n is not equal to the product of the k smallest divisors of n for any k.A072498
n is not equal to the product of the k smallest divisors of n for any k.
- Product of divisors of n which are <= n^(1/2).A072499
Product of divisors of n which are <= n^(1/2).
- Product of divisors of n which are >= n^(1/2).A072500
Product of divisors of n which are >= n^(1/2).
- Ratio of the product of divisors of n which are > n^(1/2) to product of divisors of n which are < n^(1/2).A072501
Ratio of the product of divisors of n which are > n^(1/2) to product of divisors of n which are < n^(1/2).
- Numbers that are run sums (trapezoidal, the difference between two triangular numbers) in exactly 3 ways.A072502
Numbers that are run sums (trapezoidal, the difference between two triangular numbers) in exactly 3 ways.
- Number of ways to lace a shoe with n eyelet pairs such that there is no direct "horizontal" connection between any adjacent eyelet pair.A072503
Number of ways to lace a shoe with n eyelet pairs such that there is no direct "horizontal" connection between any adjacent eyelet pair.
- a(n) = LCM of divisors of n which are <= sqrt(n).A072504
a(n) = LCM of divisors of n which are <= sqrt(n).
- a(n) = n / (LCM of divisors of n which are <= sqrt(n)).A072505
a(n) = n / (LCM of divisors of n which are <= sqrt(n)).
- Triangle giving T(n,m) = number of necklaces of two colors with 2n beads of which m=1..n are black.A072506
Triangle giving T(n,m) = number of necklaces of two colors with 2n beads of which m=1..n are black.
- Smallest start of n consecutive integers with n divisors, or 0 if no such number exists.A072507
Smallest start of n consecutive integers with n divisors, or 0 if no such number exists.
- Decimal expansion of Backhouse constant.A072508
Decimal expansion of Backhouse constant.
- Number of Fibonacci numbers F(k) <= 10^n which end in 1.A072509
Number of Fibonacci numbers F(k) <= 10^n which end in 1.
- Numbers n with property that n = product of first k divisors of n for some k.A072510
Numbers n with property that n = product of first k divisors of n for some k.