40110

Appears in sequences

• a(n) = (n^4 + n^2 + 2*n)/4.at n=20A006528
• Base-9 palindromes that start with 6.at n=29A043033
• Numbers with exactly 5 distinct prime factors each of which is a palindrome.at n=6A046403
• Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,51.at n=11A064262
• Consider the family of simple graphs. Sequence gives the triangle read by rows giving coefficients of polynomials arising from enumeration of those graphs on n edges.at n=30A098234
• a(n) = n! - primorial(n).at n=8A117735
• a(1) = 1; thereafter, a(n) is always the smallest integer > a(n-1) not leading to a contradiction, such that any three consecutive digits in the sequence sum up to a prime.at n=46A152603
• Number of length-n 0..6 arrays connected end-around, with no sequence of L<n elements immediately followed by itself (periodic "squarefree").at n=5A215226
• T(n,k) = number of length-n 0..k arrays connected end-around, with no sequence of L<n elements immediately followed by itself (periodic "squarefree").at n=60A215228
• Number of length-6 0..k arrays connected end-around, with no sequence of L<n elements immediately followed by itself (periodic "squarefree").at n=5A215229
• Numbers k such that k+1, 2k+1, 3k+1, 4k+1 are all prime.at n=14A237189
• Fixed points of A300956.at n=7A300958
• Number of regions among all distinct circles that can be constructed from n equally spaced points along a line using only a compass.at n=19A359253