26083

Properties

Appears in sequences

• a(n) = [ a(n-1)/a(1) ] + [ a(n-2)/a(2) ] + ... + [ a(1)/a(n-1) ], for n >= 3.at n=32A022870
• Discriminants of imaginary quadratic fields with class number 17 (negated).at n=38A046014
• Second term p(m) of strong prime sextets: p(m)-p(m-1) > p(m+1)-p(m) > p(m+2)-p(m+1) > p(m+3)-p(m+2) > p(m+4)-p(m+3).at n=7A054814
• Primes of the form 4*k^2 - 10*k + 7 with k positive.at n=28A073337
• Sums of groups in A075635.at n=34A075636
• Primes of the form (2k)^2 + 3(2k + 1)^2.at n=14A147297
• Number of walks within N^2 (the first quadrant of Z^2) starting and ending at (0,0) and consisting of n steps taken from {(-1, -1), (-1, 0), (-1, 1), (0, 1), (1, -1), (1, 1)}.at n=10A151351
• Number of nodes (or order) of a graph model obtained using an automata scheme on sets of order prime(n) >= 5 and in which all not halt states are linked by arcs (edges).at n=35A160772
• Primes of the form n^2 + n + 1 where n is nonprime.at n=36A185632
• Primes of the form n^2 + n + 1, where n is semiprime.at n=15A193144
• Number of nXnXn 0..6 triangular arrays with each element x equal to the number its neighbors equal to 3,4,0,2,1,0,0 for x=0,1,2,3,4,5,6.at n=5A203379
• Non-palindromic balanced primes in base 16.at n=30A256090
• Triangle read by rows T(n, k) = number of non-equivalent ways to place k non-attacking ferses on an n X n board.at n=52A278688
• Primes of the form 1 + n + n^2 + n^3 + ... + n^k, n > 1, k > 1 where n is not prime.at n=36A285017
• Number of integer partitions of n whose run-lengths are neither weakly increasing nor weakly decreasing.at n=41A332641
• a(n) = p(n^2*p(n)), where p(x) is the least prime > x.at n=29A378137
• Prime numbersat n=2867