97920

Appears in sequences

• a(n) = 2*(n+1)*binomial(n+3,4).at n=14A027789
• Reverse and add (in binary) - written in base 10.at n=23A035522
• Number of 2n-bead balanced binary strings of fundamental period 2n, rotationally equivalent to reverse, complement and reversed complement.at n=24A045665
• Number of primitive (period n) periodic palindromes using a maximum of two different symbols.at n=31A056493
• Number of primitive (period n) periodic palindromes using exactly two different symbols.at n=31A056498
• Trajectory of 22 under the Reverse and Add! operation carried out in base 2.at n=22A061561
• a(n) = 3*2^(n-1)*(2^n-1).at n=7A103897
• The following triangle contains n smallest numbers with the prime signature of n!. Sequence contains the triangle by rows.at n=34A111467
• a(n) = 2*a(n-1) + 2*a(n-2) - 4*a(n-3) with n>2, a(0)=0, a(1)=1, a(2)=3.at n=16A135094
• Numbers sigma(k) when Sum_(j=1..k) sigma(j) / sigma(k) is an integer.at n=6A168129
• Total number of possible knight moves on an n X n X n chessboard, if the knight is placed anywhere.at n=15A180413
• Numbers n for which the terms of the multiplicative sequence {n^2/A049417(n)} are integers.at n=40A185288
• A Galton triangle: T(n,k) = 2*k*T(n-1,k) + (2*k-1)*T(n-1,k-1).at n=37A187075
• Modified cyclic phone booth sequence: number of ways to occupy n labeled phone booths in a circle one by one, each time picking a phone booth adjacent to the smallest number of previously occupied phone booths.at n=9A192009
• Trajectory of 26 under the Reverse and Add! operation carried out in base 2.at n=20A213012
• Numbers k such that distances from k to three nearest squares are three perfect squares.at n=18A234335
• Numbers n such that the set of prime divisors of n is equal to the set of prime divisors of sum of proper divisors of n while n is not in A027598.at n=17A286876
• 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=44A306514
• Maximum number of graceful labelings for a simple graph on n nodes.at n=7A333728
• Number of graceful labelings for the complete tripartite graph K_{1,1,n}.at n=5A334307