Sequences
392,541 sequences
- First two significant digits of 1/n written in decimal.A061861
First two significant digits of 1/n written in decimal.
- Powerful numbers (2a): a sum of nonnegative powers of its digits.A061862
Powerful numbers (2a): a sum of nonnegative powers of its digits.
- Numbers that are the product of the squares of some subset of their digits.A061863
Numbers that are the product of the squares of some subset of their digits.
- Odd numbers that are the sum of two numbers with the same digits.A061864
Odd numbers that are the sum of two numbers with the same digits.
- Triangle in which the k-th item in the n-th row (both starting from 1) is the number of ways in which we can add k distinct integers from 1 to n, in such a way that the sum is divisible by k.A061865
Triangle in which the k-th item in the n-th row (both starting from 1) is the number of ways in which we can add k distinct integers from 1 to n, in such a way that the sum is divisible by k.
- a(n) is the number of solutions to x+y+z = 0 mod 3, where 1 <= x < y < z <= n.A061866
a(n) is the number of solutions to x+y+z = 0 mod 3, where 1 <= x < y < z <= n.
- Squares whose product of digits is also a square (allowing zeros).A061867
Squares whose product of digits is also a square (allowing zeros).
- Numbers n such that n^2 has property that the sum of its digits and the product of its digits are squares (allowing zeros).A061868
Numbers n such that n^2 has property that the sum of its digits and the product of its digits are squares (allowing zeros).
- Squares whose sum of digits as well as product of digits is a square (allowing zero).A061869
Squares whose sum of digits as well as product of digits is a square (allowing zero).
- Numbers such that |first digit - second digit + third digit - fourth digit ...| = 1.A061870
Numbers such that |first digit - second digit + third digit - fourth digit ...| = 1.
- |First digit - second digit + third digit - fourth digit ...| = 2.A061871
|First digit - second digit + third digit - fourth digit ...| = 2.
- |First digit - second digit + third digit - fourth digit ...| = 3.A061872
|First digit - second digit + third digit - fourth digit ...| = 3.
- Numbers k such that |first digit - second digit + third digit - fourth digit ...| = 4.A061873
Numbers k such that |first digit - second digit + third digit - fourth digit ...| = 4.
- |First digit - second digit + third digit - fourth digit ...| = 5.A061874
|First digit - second digit + third digit - fourth digit ...| = 5.
- |First digit - second digit + third digit - fourth digit ...| = 6.A061875
|First digit - second digit + third digit - fourth digit ...| = 6.
- |First digit - second digit + third digit - fourth digit ...| = 7.A061876
|First digit - second digit + third digit - fourth digit ...| = 7.
- |First digit - second digit + third digit - fourth digit ...| = 8.A061877
|First digit - second digit + third digit - fourth digit ...| = 8.
- |First digit - second digit + third digit - fourth digit ...| = 9.A061878
|First digit - second digit + third digit - fourth digit ...| = 9.
- First (leftmost) digit - second digit + third digit - fourth digit .... = 10.A061879
First (leftmost) digit - second digit + third digit - fourth digit .... = 10.
- First (leftmost) digit - second digit + third digit - fourth digit .... = 11.A061880
First (leftmost) digit - second digit + third digit - fourth digit .... = 11.
- First (leftmost) digit - second digit + third digit - fourth digit .... = 12.A061881
First (leftmost) digit - second digit + third digit - fourth digit .... = 12.
- a(n) = Smallest nontrivial number k > 9 such that first (leftmost) digit - second digit + third digit - fourth digit ... of k = n.A061882
a(n) = Smallest nontrivial number k > 9 such that first (leftmost) digit - second digit + third digit - fourth digit ... of k = n.
- Largest triangular number less than or equal to sum of previous terms with a(0)=1.A061883
Largest triangular number less than or equal to sum of previous terms with a(0)=1.
- a(n) = Sum_{ d | n } phi(lcm(d,n/d)), where phi(n) = Euler totient A000010.A061884
a(n) = Sum_{ d | n } phi(lcm(d,n/d)), where phi(n) = Euler totient A000010.
- n + largest triangular number less than or equal to n.A061885
n + largest triangular number less than or equal to n.
- Largest square less than or equal to sum of previous terms.A061886
Largest square less than or equal to sum of previous terms.
- n + largest square less than or equal to n; numbers in the range [2k^2,2k^2+2k] for some k.A061887
n + largest square less than or equal to n; numbers in the range [2k^2,2k^2+2k] for some k.
- Numbers k such that k^2 is the sum of the first m primes for some m.A061888
Numbers k such that k^2 is the sum of the first m primes for some m.
- a(n) = number of solutions to x_1 + x_2 + ... + x_n = x_{n+1} where each x_i is a factorial.A061889
a(n) = number of solutions to x_1 + x_2 + ... + x_n = x_{n+1} where each x_i is a factorial.
- Squares that are the sum of initial primes.A061890
Squares that are the sum of initial primes.
- a(0) = 1; for n>0, a(n) = a(n-1) if n is already in the sequence, a(n) = a(n-1) + 3 otherwise.A061891
a(0) = 1; for n>0, a(n) = a(n-1) if n is already in the sequence, a(n) = a(n-1) + 3 otherwise.
- Lionel-Levine-sequence generated by (1,0,0).A061892
Lionel-Levine-sequence generated by (1,0,0).
- Table of Lionel-Levine-sequence generated by (1,0,0).A061893
Table of Lionel-Levine-sequence generated by (1,0,0).
- Lionel-Levine-sequence generated by (2,0).A061894
Lionel-Levine-sequence generated by (2,0).
- Table of Lionel-Levine-sequence generated by (2,0).A061895
Table of Lionel-Levine-sequence generated by (2,0).
- Triangle of coefficients of Lucas polynomials.A061896
Triangle of coefficients of Lucas polynomials.
- Square table by antidiagonals of number of routes of length 2k+n on the sides of a 2n-gon from a point to its opposite point.A061897
Square table by antidiagonals of number of routes of length 2k+n on the sides of a 2n-gon from a point to its opposite point.
- Swap each prime in factorization of n with "neighbor" prime.A061898
Swap each prime in factorization of n with "neighbor" prime.
- Fibonacci numbers that are not squarefree.A061899
Fibonacci numbers that are not squarefree.
- Triangular numbers that are not squarefree.A061900
Triangular numbers that are not squarefree.
- Number of distinct numbers that can be formed from the digits of n.A061901
Number of distinct numbers that can be formed from the digits of n.
- Number of digits in n-th term of A061482.A061902
Number of digits in n-th term of A061482.
- Number of distinct elements of the iterative cycle: n -> sum of digits of n^2.A061903
Number of distinct elements of the iterative cycle: n -> sum of digits of n^2.
- Numbers n such that the iterative cycle: n -> sum of digits of n^2 has only one distinct element.A061904
Numbers n such that the iterative cycle: n -> sum of digits of n^2 has only one distinct element.
- The iterative cycle: n -> sum of digits of n^2 has only two distinct elements.A061905
The iterative cycle: n -> sum of digits of n^2 has only two distinct elements.
- Obtain m by omitting trailing zeros from n; a(n) = smallest k such that k*m is a palindrome.A061906
Obtain m by omitting trailing zeros from n; a(n) = smallest k such that k*m is a palindrome.
- The iterative cycle: n -> sum of digits of n^2 has only four distinct elements.A061907
The iterative cycle: n -> sum of digits of n^2 has only four distinct elements.
- Duplicate of A056020.A061908
Duplicate of A056020.
- Skinny numbers: numbers n such that there are no carries when n is squared by "long multiplication".A061909
Skinny numbers: numbers n such that there are no carries when n is squared by "long multiplication".
- Positive numbers k such that sum of digits of k^2 is a square.A061910
Positive numbers k such that sum of digits of k^2 is a square.