125440

Appears in sequences

• a(n) = n^2*(n+1)*(n+2)^2/6.at n=14A004256
• Expansion of log(1+tan(x)*x).at n=5A009379
• Surround numbers of an n X 2 rectangle when n is even.at n=14A061524
• Numbers k such that k^4096 + 1 is prime (a generalized Fermat prime).at n=22A088362
• Number of partitions of 2^n into powers of n.at n=14A196889
• Number of n X 5 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 0 1 vertically.at n=13A207450
• Numbers k such that digital root of k equals largest prime factor of k.at n=43A209192
• Smallest k such that k^(2^n) + 1 and (k+2)^(2^n) + 1 are both prime.at n=12A217993
• Number of length n+4 0..3 arrays with no disjoint pairs in any consecutive five terms having the same sum.at n=25A247399
• Triangle read by rows, T(n, k) = 4^n*[x^k]hypergeometric([3/2, -n], [3], -x), n>=0, 0<=k<=n.at n=31A254632
• Number x such that x | A255242(x).at n=33A255243
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 470", based on the 5-celled von Neumann neighborhood.at n=17A288497
• Triangle T(n,p) read by rows: the order of the semigroup of orientation-preserving partial transformations of n elements with height p.at n=41A289711
• G.f.: Sum_{n>=0} 2^n * ((1+x)^n - 1)^n.at n=5A301581
• Least b such that b^(2^n) + 1 is a Proth prime (A080076).at n=12A334053
• Numbers k such that A000005(k) = A000688(k).at n=22A369168