65472

Appears in sequences

• a(n) = floor(Fibonacci(n)/3).at n=27A004696
• a(n) = floor(n*(n-1)*(n-2)*(n-3)/15).at n=33A011925
• [ n(n-1)(n-2)(n-3)/17 ].at n=34A011927
• Numbers j such that sigma(sigma(j)) = k*j for some k.at n=35A019278
• Let sigma_m (n) be result of applying sum-of-divisors function m times to n; call n (m,k)-perfect if sigma_m (n) = k*n; sequence gives the (2,8)-perfect numbers.at n=7A019285
• Let sigma_m (n) be result of applying sum-of-divisors function m times to n; call n (m,k)-perfect if sigma_m (n) = k*n; sequence gives the (3,k)-perfect numbers.at n=29A019292
• a(n) = 4^n - n^2.at n=8A024038
• a(n) = (F(8*n+3) - 2)/3, where F = A000045 (the Fibonacci sequence).at n=3A049657
• A hierarchical sequence (S(W'2{3}c) - see A059126).at n=4A059155
• a(n) is the number of distinct patterns (modulo geometric D3-operations) with strict median-reflective (palindrome) symmetry (i.e., having no other symmetry) which can be formed by an equilateral triangular arrangement of closely packed black and white cells satisfying the local matching rule of Pascal's triangle modulo 2, where n is the number of cells in each edge of the arrangement. The matching rule is such that any elementary top-down triangle of three neighboring cells in the arrangement contains either one or three white cells.at n=30A060549
• a(n) = lcm(6n+2, 6n+4, 6n+6).at n=10A061506
• Numbers that have exactly nine prime factors counted with multiplicity (A046312) whose digit reversal is different and also has 9 prime factors (with multiplicity).at n=8A109029
• Number of rooted planar n-trees whose number of leaves is equal to 2 modulo 3.at n=12A119367
• Number of permutations of floor(i*8/5), i=0..n-1, with all sums of 2 through 4 adjacent terms respectively unique.at n=8A147905
• Number of permutations of floor(i*8/5), i=0..n-1, with all sums of 2 through 5 adjacent terms respectively unique.at n=8A147914
• a(n) = 64*n^2 - 2*n.at n=31A158067
• Expansion of 64*x^2/(1 - 1023*x + 1023*x^2 - x^3).at n=3A159677
• a(n) = 64*(2^n - 1).at n=10A175166
• G.f. satisfies: A(A(x))^2 = A(x)^2 + 4*x^3.at n=5A191565
• Monotonic ordering of nonnegative differences 4^i-8^j, for 40>= i>=0, j>=0.at n=25A192167