44000

Appears in sequences

• Triangle whose (i,j)-th entry is binomial(i,j)*10^(i-j)*11^j.at n=11A038313
• Triangle read by rows whose (i,j)-th entry is binomial(i,j)*11^(i-j)*10^j.at n=13A038324
• Numbers n such that A048767(n) = n.at n=35A048768
• Number of base 28 circular n-digit numbers with adjacent digits differing by 2 or less.at n=6A124956
• Numbers such that the digital sum base 2 and the digital sum base 5 and the digital sum base 10 all are equal.at n=28A135125
• Records in A160256.at n=33A151545
• a(n) = smallest number which has in its Spanish name the letter "m" in the n-th position,or -1 if no such number exists.at n=15A164813
• a(n) = smallest number which has in its Spanish name the letter "l" in the n-th position, or -1 if no such number exists.at n=17A164814
• Numbers whose decimal expansion contains only 0's and 4's.at n=24A169967
• Numbers with prime factorization pq^3r^5.at n=22A190011
• Numbers such that each digit is the sum of two or more other digits.at n=15A203591
• Composite numbers m such that Sum_{i=1..k} (p_i/(p_i+1)) - Product_{i=1..k} (p_i/(p_i-1)) is an integer, where p_i are the k prime factors of m (with multiplicity).at n=17A230111
• a(n) = n*(n + 1)*(19*n - 16)/6.at n=24A237618
• Records values in A072994.at n=61A251642
• Number x = concat(MSD(x),b) such that MSD(x)*b = phi(x), where MSD(x) is the Most Significant Digit of x and phi(x) is the Euler totient function of x.at n=30A286130
• Number of irredundant sets in the n-Fibonacci cube graph.at n=5A291963
• Numbers whose ordered prime signature is equal to the set of distinct prime indices in decreasing order.at n=24A324571
• G.f. = Phi^5, where Phi = g.f. for A028930.at n=23A328530
• Irregular triangle T(n,k), n >= 0, 0 <= k < 2^(n-1), where T(n,k) = Product_{j=0..n-1} prime(j+1)^((n-j)*d_j), where d_j is the bit with digit weight 2^j in the binary expansion of 2^(n-1)+k.at n=21A384003
• Irregular triangle T(n,k), n >= 0, 0 <= k < 2^(n-1), where T(n,k) = Product_{j=0..n-1} prime(n-j)^((j+1)*d_j), where d_j is the bit with digit weight 2^j in the binary expansion of 2^(n-1)+k.at n=21A387465