19696

Appears in sequences

• a(n) = least 2k such that p is the least prime in a Goldbach partition of 2k, where p = prime(n).at n=29A025017
• Denominators of continued fraction convergents to sqrt(604).at n=14A042159
• McKay-Thompson series of class 42b for Monster.at n=54A058676
• A nonsense sequence.at n=35A089075
• Number of partitions of n into parts that are neither all squarefree, nor all not squarefree.at n=37A117395
• a(n) = 2*{0,a(n-2),0} + 2*{-1/2,a(n-1)}+2*{a(n-1),-1/2}.at n=40A152602
• Numbers n with property that concatenation (2*n+1)//n of the decimals is a square.at n=7A176185
• Number of 6-step E, S, NW and NE-moving king's tours on an n X n board summed over all starting positions.at n=7A187589
• A boustrophedon triangle.at n=48A227862
• Number of (2+2) X (n+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 0 2 3 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 0 2 3 6 or 7.at n=12A252534
• Number of nX4 arrays of permutations of 4 copies of 0..n-1 with every element equal to or 1 greater than any northeast neighbor modulo n and the upper left element equal to 0.at n=3A267834
• T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to or 1 greater than any northeast neighbor modulo n and the upper left element equal to 0.at n=24A267836
• Number of 4Xn arrays containing n copies of 0..4-1 with every element equal to or 1 greater than any northeast neighbor modulo 4 and the upper left element equal to 0.at n=3A267837
• Number of partitions of n containing no parts that are powers of 2 with positive exponent.at n=51A276431
• Number of ways to write n as an ordered sum of 6 primes.at n=48A340962
• a(n) = Sum_{d|n} d^(phi(n/d) - 1).at n=32A345268