48960

Appears in sequences

• Number of tree-rooted planar maps with 3 faces and n vertices and no isthmuses.at n=14A006470
• Reverse and add (in binary) - written in base 10.at n=21A035522
• a(n)=a(n-1)+a(m), where m=2n-2-2^(p+1) and 2^p<n-1<=2^(p+1), for n >= 4.at n=35A050067
• Trajectory of 22 under the Reverse and Add! operation carried out in base 2.at n=20A061561
• Second row of array in A101385.at n=29A101644
• Sylvester dividends for A002605.at n=17A105608
• Triangle P, read by rows, that satisfies [P^4](n,k) = P(n+1,k+1) for n>=k>=0, also [P^(4*m)](n,k) = [P^m](n+1,k+1) for all m, where [P^m](n,k) denotes the element at row n, column k, of the matrix power m of P, with P(k,k)=1 and P(k+1,1)=P(k+1,0) for k>=0.at n=17A111845
• Numbers that together with their prime factors contain every digit exactly once.at n=3A124668
• If X_1,...,X_n is a partition of a 2n-set X into 2-blocks then a(n) is equal to the number of 4-subsets of X containing none of X_i, (i=1,...,n).at n=14A130810
• Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to n-4.at n=11A180294
• Numbers n for which the terms of the multiplicative sequence {n^2/A049417(n)} are integers.at n=32A185288
• Numbers with prime factorization pqr^2s^6.at n=6A190474
• Number of nX1 0..1 arrays with the counts of all possible adjacent horizontal and vertical pair sum values being within one of each other.at n=20A203631
• Trajectory of 26 under the Reverse and Add! operation carried out in base 2.at n=18A213012
• Number of 2 X 2 matrices with entries in {0,1,...,n} and odd trace with no elements repeated.at n=18A279905
• Decimal representation of binary numbers with string structure 10s00, s in {0,1}*, such that it results in a non-palindromic cycle of length 4 in the Reverse and Add! procedure in base 2.at n=33A306514
• Values of Euler's totient phi for A050498.at n=5A339883
• T(n, k) = [x^k] 2^n*(Euler(n, x/2) + Euler(n, x)), where Euler(n, x) are the Euler polynomials. Triangle read by rows, T(n, k) for 0 <= k <= n.at n=47A342314
• Irregular triangle read by rows where T(n,k) is the number of independent sets of size k in the n-hypercube graph.at n=27A354802
• Positions of records in A356018, i.e., integers whose number of evil divisors sets a new record.at n=27A356020