25850

Appears in sequences

• a(n) = round(10000*log_2(n)).at n=5A004269
• a(n) = ceiling(10000*log_2(n)).at n=5A004270
• Number of vertex-transitive graphs with n nodes.at n=27A006799
• Number of asymmetric rooted connected graphs where every block is a complete graph.at n=13A007561
• a(n) = dot_product(1,2,...,n)*(5,6,...,n,1,2,3,4).at n=39A026043
• Lengths of intervals between special points in Recamán's sequence A005132.at n=17A065053
• Numbers k such that k and k^2 use only the digits 0, 2, 5, 6 and 8.at n=32A136913
• Sequence defined by the recurrence formula a(n+1)=sum(a(p)*a(n-p)+k,p=0..n)+l for n>=1, with here a(0)=1, a(1)=10, k=0 and l=-2.at n=6A177172
• Number of (w,x,y,z) with all terms in {1,...,n} and 2|w-x|>=n+|y-z|.at n=21A212688
• Number of (w,x,y) with all terms in {0,...,n} and w != max(|w-x|, |x-y|).at n=29A213501
• Numbers n for which the alternating sum of the digits of n^n is 0.at n=34A244212
• Smallest m, such that there are exactly n solutions of the equation (m+k)' = m' + k', where 1 <= k <= 2*m and x' = A003415(x), the arithmetic derivative of x.at n=16A258138
• Sum of the asymmetry degrees of all 00-avoiding binary words of length n.at n=18A275436
• Sum of the asymmetry degrees of all compositions of n into odd parts.at n=21A275441
• p-INVERT of the positive integers, where p(S) = 1 - S^5.at n=12A290893
• p-INVERT of (0,1,0,1,0,1,...), where p(S) = 1 - S^5.at n=25A291218
• Number of 3Xn 0..1 arrays with every element equal to 0, 1, 3, 4 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=11A303041
• a(n) = 2*n^3 + 9*n^2 + 9*n.at n=22A303609
• a(n) = number of pairs (p,q) of partitions of n such that d(p,q) > o(p,q), where d and o are distance functions; see Comments.at n=25A368566