Sequences
392,541 sequences
- Integers m such that the last digit of Fibonacci(m) is 9.A072711
Integers m such that the last digit of Fibonacci(m) is 9.
- Primes p such that p divides the (right) concatenation of all numbers from 1 to p written in base 10 (most significant digit on left).A072712
Primes p such that p divides the (right) concatenation of all numbers from 1 to p written in base 10 (most significant digit on left).
- a(1)=a(2)=a(3)=a(4)=a(5)=1; for n>5, a(n)*a(n-5) = a(n-1)*a(n-2)*a(n-3)*a(n-4)+1.A072713
a(1)=a(2)=a(3)=a(4)=a(5)=1; for n>5, a(n)*a(n-5) = a(n-1)*a(n-2)*a(n-3)*a(n-4)+1.
- Duplicate of A051786.A072714
Duplicate of A051786.
- Record differences between n-th prime and 2n-th prime.A072715
Record differences between n-th prime and 2n-th prime.
- Integers expressible as (x^3 + y^3 + z^3)/(x*y*z) with positive integers x, y and z. (Alternatively, the integers expressible as x/y + y/z + z/x with positive integers x, y and z.)A072716
Integers expressible as (x^3 + y^3 + z^3)/(x*y*z) with positive integers x, y and z. (Alternatively, the integers expressible as x/y + y/z + z/x with positive integers x, y and z.)
- Let d(k) be the sequence whose values are in (1,2,3,4,5,6,7,8,9) and are such that the continued fraction for the decimal number D(n)=0.d(1)d(2)...d(n) has strictly more elements than the continued fraction for D(n-1)=0.d(1)d(2)...d(n-1) and d(n) is as small as possible. Sequence gives values of d(n)=a(n) for d(1)=1.A072717
Let d(k) be the sequence whose values are in (1,2,3,4,5,6,7,8,9) and are such that the continued fraction for the decimal number D(n)=0.d(1)d(2)...d(n) has strictly more elements than the continued fraction for D(n-1)=0.d(1)d(2)...d(n-1) and d(n) is as small as possible. Sequence gives values of d(n)=a(n) for d(1)=1.
- Numbers n such that 12 applications of 'Reverse and Subtract' lead to n, whereas fewer than 12 applications do not lead to n.A072718
Numbers n such that 12 applications of 'Reverse and Subtract' lead to n, whereas fewer than 12 applications do not lead to n.
- Numbers n such that 17 applications of 'Reverse and Subtract' lead to n, whereas fewer than 17 applications do not lead to n.A072719
Numbers n such that 17 applications of 'Reverse and Subtract' lead to n, whereas fewer than 17 applications do not lead to n.
- Number of partitions of n into parts which are each powers of a single number (which may vary between partitions).A072720
Number of partitions of n into parts which are each powers of a single number (which may vary between partitions).
- Number of partitions of n into parts which are each positive powers of a single number >1 (which may vary between partitions).A072721
Number of partitions of n into parts which are each positive powers of a single number >1 (which may vary between partitions).
- Smallest of 6 consecutive integers divisible respectively by 6 consecutive primes.A072722
Smallest of 6 consecutive integers divisible respectively by 6 consecutive primes.
- Integers which are exactly the concatenation of the first m odd numbers (A019519) divided by their sum (A000290 = m^2).A072723
Integers which are exactly the concatenation of the first m odd numbers (A019519) divided by their sum (A000290 = m^2).
- Integers which are exactly the concatenation of the first m even numbers (A019520) divided by their sum (A002378 = m^2+m).A072724
Integers which are exactly the concatenation of the first m even numbers (A019520) divided by their sum (A002378 = m^2+m).
- Integers which are exactly the concatenation of the first m numbers (A007908) divided by their sum (A000217 = m*(m+1)/2).A072725
Integers which are exactly the concatenation of the first m numbers (A007908) divided by their sum (A000217 = m*(m+1)/2).
- Numerator of the rationals >= 1 whose continued fractions consist of only even terms, in ascending order by the sum of the continued fraction terms and descending by lowest order continued fraction terms to highest.A072726
Numerator of the rationals >= 1 whose continued fractions consist of only even terms, in ascending order by the sum of the continued fraction terms and descending by lowest order continued fraction terms to highest.
- Denominator of the rationals >= 1 whose continued fractions consist of only even terms, in ascending order by the sum of the continued fraction terms and descending by lowest order continued fraction terms to highest.A072727
Denominator of the rationals >= 1 whose continued fractions consist of only even terms, in ascending order by the sum of the continued fraction terms and descending by lowest order continued fraction terms to highest.
- Numerator of rationals >= 1 whose continued fractions consist only of 1's and 2's, in ascending order by the sum of the continued fraction terms and descending by lowest order continued fraction terms to highest.A072728
Numerator of rationals >= 1 whose continued fractions consist only of 1's and 2's, in ascending order by the sum of the continued fraction terms and descending by lowest order continued fraction terms to highest.
- Denominator of rationals >= 1 whose continued fractions consist only of 1's and 2's, in ascending order by the sum of the continued fraction terms and descending by lowest order continued fraction terms to highest.A072729
Denominator of rationals >= 1 whose continued fractions consist only of 1's and 2's, in ascending order by the sum of the continued fraction terms and descending by lowest order continued fraction terms to highest.
- Smallest of 5 consecutive integers divisible respectively by 5 consecutive primes.A072730
Smallest of 5 consecutive integers divisible respectively by 5 consecutive primes.
- Difference of numbers of composite and prime numbers <= n.A072731
Difference of numbers of composite and prime numbers <= n.
- Simple triangle-stretching N X N -> N bijection: push terms in the middle twice as far down to make space for the terms obtained by bisecting the edges, which are thus contracted by the same factor. Do this for all "triangle-shells" successively contained inside each other in A001477.A072732
Simple triangle-stretching N X N -> N bijection: push terms in the middle twice as far down to make space for the terms obtained by bisecting the edges, which are thus contracted by the same factor. Do this for all "triangle-shells" successively contained inside each other in A001477.
- Simple triangle-stretching N X N -> N bijection: Inverse of A072732.A072733
Simple triangle-stretching N X N -> N bijection: Inverse of A072732.
- Simple triangle-stretching N X N -> N bijection, variant of A072732.A072734
Simple triangle-stretching N X N -> N bijection, variant of A072732.
- Simple triangle-stretching N X N -> N bijection: Inverse of A072734, variant of A072733.A072735
Simple triangle-stretching N X N -> N bijection: Inverse of A072734, variant of A072733.
- X-projection of the tabular N X N -> N bijection A072732.A072736
X-projection of the tabular N X N -> N bijection A072732.
- Y-projection of the tabular N X N -> N bijection A072732.A072737
Y-projection of the tabular N X N -> N bijection A072732.
- X-projection of the tabular N X N -> N bijection A072733.A072738
X-projection of the tabular N X N -> N bijection A072733.
- Y-projection of the tabular N X N -> N bijection A072733.A072739
Y-projection of the tabular N X N -> N bijection A072733.
- X-projection of the tabular N X N -> N bijection A072734.A072740
X-projection of the tabular N X N -> N bijection A072734.
- Y-projection of the tabular N X N -> N bijection A072734.A072741
Y-projection of the tabular N X N -> N bijection A072734.
- Lesser members of a pair of primes (p, q) such that, for some integer k, (p+q)/2 = 2^k and p > 2^(k-1).A072742
Lesser members of a pair of primes (p, q) such that, for some integer k, (p+q)/2 = 2^k and p > 2^(k-1).
- Greater members of a pair of primes (p, q) such that, for some integer k, (p+q)/2 = 2^k and p > 2^(k-1).A072743
Greater members of a pair of primes (p, q) such that, for some integer k, (p+q)/2 = 2^k and p > 2^(k-1).
- Difference between the members of a pair of primes (p, q) with p < q and such that, for some integer k, (p+q)/2 = 2^k and p > 2^(k-1).A072744
Difference between the members of a pair of primes (p, q) with p < q and such that, for some integer k, (p+q)/2 = 2^k and p > 2^(k-1).
- Product of the members of pairs of primes (p, q) with p < q and such that, for some integer k, (p+q)/2 = 2^k and p > 2^(k-1).A072745
Product of the members of pairs of primes (p, q) with p < q and such that, for some integer k, (p+q)/2 = 2^k and p > 2^(k-1).
- Number of pairs of primes (p, q) such that, for some integer k, (p+q)/2 = 2^k, 2^(k-1) < p < q, and p <= n.A072746
Number of pairs of primes (p, q) such that, for some integer k, (p+q)/2 = 2^k, 2^(k-1) < p < q, and p <= n.
- Counting factor 2 in the first n squarefree numbers.A072747
Counting factor 2 in the first n squarefree numbers.
- Counting factor 3 in the first n squarefree numbers.A072748
Counting factor 3 in the first n squarefree numbers.
- Count of factors of 5 in the first n squarefree numbers.A072749
Count of factors of 5 in the first n squarefree numbers.
- Counting factor 7 in the first n squarefree numbers.A072750
Counting factor 7 in the first n squarefree numbers.
- Greatest of the most frequent prime factors of squarefree numbers <= n; a(1)=1.A072751
Greatest of the most frequent prime factors of squarefree numbers <= n; a(1)=1.
- Maximum gap in one-stage prime-sieves.A072752
Maximum gap in one-stage prime-sieves.
- Maximum gap in two-stage prime-sieves.A072753
Maximum gap in two-stage prime-sieves.
- Numerators of continued fraction convergents to Copeland-Erdos constant.A072754
Numerators of continued fraction convergents to Copeland-Erdos constant.
- Denominators of continued fraction convergents to Copeland-Erdos constant.A072755
Denominators of continued fraction convergents to Copeland-Erdos constant.
- a(n) = least nonnegative integer not a(k) and not a(k)+floor(a(k)/2) for k<n.A072756
a(n) = least nonnegative integer not a(k) and not a(k)+floor(a(k)/2) for k<n.
- Complement of A072756.A072757
Complement of A072756.
- a(0)=0, a(1)=1 and for k>1, a(2k)=least positive integer not a(j) for j<2k; and a(2k+1)=a(2k)+Floor(a(2k)/2).A072758
a(0)=0, a(1)=1 and for k>1, a(2k)=least positive integer not a(j) for j<2k; and a(2k+1)=a(2k)+Floor(a(2k)/2).
- Inverse of permutation A072758 of the nonnegative integers.A072759
Inverse of permutation A072758 of the nonnegative integers.
- Smallest of 7 consecutive integers divisible respectively by 7 consecutive primes.A072760
Smallest of 7 consecutive integers divisible respectively by 7 consecutive primes.