Sequences
392,541 sequences
- Square array T(n,k) of second binomial transforms of generalized Fibonacci numbers, read by ascending antidiagonals, with n, k >= 0.A083861
Square array T(n,k) of second binomial transforms of generalized Fibonacci numbers, read by ascending antidiagonals, with n, k >= 0.
- Main diagonal of array A083857.A083862
Main diagonal of array A083857.
- Consider recurrence b(0) = n/3, b(n) = b(n-1)*floor(b(n-1)); sequence gives first integer reached, or -1 if no integer is ever reached.A083863
Consider recurrence b(0) = n/3, b(n) = b(n-1)*floor(b(n-1)); sequence gives first integer reached, or -1 if no integer is ever reached.
- Decimal expansion of Product_{k>=0} (1 - 1/(2^k+1)).A083864
Decimal expansion of Product_{k>=0} (1 - 1/(2^k+1)).
- Sums of (one or more distinct) k-perfect numbers.A083865
Sums of (one or more distinct) k-perfect numbers.
- Positions of zeros in Per Nørgård's infinity sequence (A004718).A083866
Positions of zeros in Per Nørgård's infinity sequence (A004718).
- a(n) is the number of divisors of the n-th decimal palindrome that are palindromes.A083867
a(n) is the number of divisors of the n-th decimal palindrome that are palindromes.
- Number of palindromic divisors d of n-th decimal palindrome m, such that 9<d<m.A083868
Number of palindromic divisors d of n-th decimal palindrome m, such that 9<d<m.
- a(1)=1 then a(n) is the least k>=1 such that the nested radical sqrt(a(1)^2+sqrt(a(2)^2+sqrt(a(3)^2+(....+sqrt(a(n)^2)))...) is an integer.A083869
a(1)=1 then a(n) is the least k>=1 such that the nested radical sqrt(a(1)^2+sqrt(a(2)^2+sqrt(a(3)^2+(....+sqrt(a(n)^2)))...) is an integer.
- Number of pairs (x,y) of palindromes such that n-th decimal palindrome = x*y and 1<=x<=y.A083870
Number of pairs (x,y) of palindromes such that n-th decimal palindrome = x*y and 1<=x<=y.
- Decimal expansion of sqrt(355/113).A083871
Decimal expansion of sqrt(355/113).
- Triangle read by rows in which row n lists first appearance of m such that m divides n!.A083872
Triangle read by rows in which row n lists first appearance of m such that m divides n!.
- Primitive abundant numbers that set a new record for number of divisors.A083873
Primitive abundant numbers that set a new record for number of divisors.
- Numbers k such that sigma(k) + tau(k) = 2k.A083874
Numbers k such that sigma(k) + tau(k) = 2k.
- One-sixth the areas of primitive Heronian triangles sorted.A083875
One-sixth the areas of primitive Heronian triangles sorted.
- Least pseudoprime to base 2 through base prime(n).A083876
Least pseudoprime to base 2 through base prime(n).
- Absolute value of determinant of n X n matrix where the element a(i,j) = if i + j > n then 2*(i + j -n) - 1, else 2*(n + 1 - i - j).A083877
Absolute value of determinant of n X n matrix where the element a(i,j) = if i + j > n then 2*(i + j -n) - 1, else 2*(n + 1 - i - j).
- a(0)=1, a(1)=3, a(n) = 6*a(n-1) - 7*a(n-2), n >= 2.A083878
a(0)=1, a(1)=3, a(n) = 6*a(n-1) - 7*a(n-2), n >= 2.
- a(0)=1, a(1)=4, a(n) = 8*a(n-1) - 14*a(n-2), n >= 2.A083879
a(0)=1, a(1)=4, a(n) = 8*a(n-1) - 14*a(n-2), n >= 2.
- a(0)=1, a(1)=5, a(n) = 10*a(n-1) - 23*a(n-2), n >= 2.A083880
a(0)=1, a(1)=5, a(n) = 10*a(n-1) - 23*a(n-2), n >= 2.
- a(n) = 6*a(n-1) - 6*a(n-2), with a(0)=1, a(1)=3.A083881
a(n) = 6*a(n-1) - 6*a(n-2), with a(0)=1, a(1)=3.
- a(0)=1, a(1)=4, a(n)=8a(n-1)-13a(n-2), n>=2.A083882
a(0)=1, a(1)=4, a(n)=8a(n-1)-13a(n-2), n>=2.
- Odd short leg of more than one primitive Pythagorean triangle.A083883
Odd short leg of more than one primitive Pythagorean triangle.
- a(n) = (3^(2*n) + 1) / 2.A083884
a(n) = (3^(2*n) + 1) / 2.
- (4^n+2^n+0^n+(-2)^n)/4.A083885
(4^n+2^n+0^n+(-2)^n)/4.
- Expansion of e.g.f. exp(3*x)*exp(x^2).A083886
Expansion of e.g.f. exp(3*x)*exp(x^2).
- Positions of records in A085020.A083887
Positions of records in A085020.
- Number of divisors of n with largest digit = 1 (base 10).A083888
Number of divisors of n with largest digit = 1 (base 10).
- Number of divisors of n with largest digit = 2 (base 10).A083889
Number of divisors of n with largest digit = 2 (base 10).
- Number of divisors of n with largest digit = 3 (base 10).A083890
Number of divisors of n with largest digit = 3 (base 10).
- Number of divisors of n with largest digit = 4 (base 10).A083891
Number of divisors of n with largest digit = 4 (base 10).
- Number of divisors of n with largest digit = 5 (base 10).A083892
Number of divisors of n with largest digit = 5 (base 10).
- Number of divisors of n with largest digit = 6 (base 10).A083893
Number of divisors of n with largest digit = 6 (base 10).
- Number of divisors of n with largest digit = 7 (base 10).A083894
Number of divisors of n with largest digit = 7 (base 10).
- Number of divisors of n with largest digit = 8 (base 10).A083895
Number of divisors of n with largest digit = 8 (base 10).
- Number of divisors of n with largest digit = 9 (base 10).A083896
Number of divisors of n with largest digit = 9 (base 10).
- Number of divisors of n with largest digit <= 2 (base 10).A083897
Number of divisors of n with largest digit <= 2 (base 10).
- Number of divisors of n with largest digit <= 3 (base 10).A083898
Number of divisors of n with largest digit <= 3 (base 10).
- Number of divisors of n with largest digit <= 4 (base 10).A083899
Number of divisors of n with largest digit <= 4 (base 10).
- Number of divisors of n with largest digit <= 5 (base 10).A083900
Number of divisors of n with largest digit <= 5 (base 10).
- Number of divisors of n with largest digit <= 6 (base 10).A083901
Number of divisors of n with largest digit <= 6 (base 10).
- Number of divisors of n with the largest digit of the divisor <= 7 (base 10).A083902
Number of divisors of n with the largest digit of the divisor <= 7 (base 10).
- Number of divisors of n with largest digit <= 8 (base 10).A083903
Number of divisors of n with largest digit <= 8 (base 10).
- G.f. 1/(1-x) * Sum_{k>=0} 3^k * x^2^(k+1)/(1+x^2^k).A083904
G.f. 1/(1-x) * Sum_{k>=0} 3^k * x^2^(k+1)/(1+x^2^k).
- G.f.: 1/(1-x) * sum(k>=0, (-1)^k*x^2^(k+1)/(1+x^2^k)).A083905
G.f.: 1/(1-x) * sum(k>=0, (-1)^k*x^2^(k+1)/(1+x^2^k)).
- Table read by rows: T(n, k) is the number of length n binary words with exactly k inversions.A083906
Table read by rows: T(n, k) is the number of length n binary words with exactly k inversions.
- Duplicate of A034386.A083907
Duplicate of A034386.
- Record positions in A082469.A083908
Record positions in A082469.
- Numbers of the form 10^(m-k)*(10^(m+k+1)-10^k), m, k >= 0.A083909
Numbers of the form 10^(m-k)*(10^(m+k+1)-10^k), m, k >= 0.
- Number of divisors of n that are congruent to 0 modulo 10.A083910
Number of divisors of n that are congruent to 0 modulo 10.