31307

Properties

Appears in sequences

• a(n) = T(2n,n), T given by A026725.at n=8A026726
• Greatest number in row n of array T given by A026725.at n=16A026731
• Numbers whose set of base-13 digits is {1,3}.at n=37A032920
• Denominators of continued fraction convergents to sqrt(513).at n=11A041981
• Numbers whose base-5 representation contains exactly three 0's and three 2's.at n=31A045187
• Sum of composite numbers between prime p and nextprime(p) is palindromic.at n=32A054266
• Sum of composite numbers between prime p and nextprime(p) is palindromic with restriction 'p + 1 <> sum'.at n=20A054267
• Engel expansion of Sum_{k>=0} 1/(7 + k)^k.at n=13A063190
• Numbers n such that p(8n) is prime, where p(n) is the number of partitions of n.at n=33A114168
• Number of 2 X n matrices containing a 1 in the top left entry, all entries are integer values and adjacent entries differ by at most 1.at n=5A138977
• Expansion of 1/(1-x-x^3*c(x^3)), c(x) the g.f. of A000108.at n=24A165407
• Numbers k that divide the sum of digits of 13^k.at n=47A175525
• a(0)=113, then a(n) = smallest prime p not already used such that the first three digits of p = the last three digits of a(n-1).at n=36A175687
• T(n,k)=Number of 0..2 colorings of an nx(k+1) array circular in the k+1 direction with new values 0..2 introduced in row major order.at n=33A214101
• Number of 0..2 colorings of a 6X(n+1) array circular in the n+1 direction with new values 0..2 introduced in row major order.at n=2A214105
• Number of nX6 0..4 arrays with entries increasing mod 5 by 0, 1 or 2 rightwards and downwards, starting with upper left zero.at n=1A222167
• T(n,k)=Number of nXk 0..4 arrays with entries increasing mod 5 by 0, 1 or 2 rightwards and downwards, starting with upper left zero.at n=22A222169
• T(n,k)=Number of nXk 0..4 arrays with entries increasing mod 5 by 0, 1 or 2 rightwards and downwards, starting with upper left zero.at n=26A222169
• T(n,k)=Petersen graph (3,1) coloring a rectangular array: number of nXk 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,3 3,5 3,4 1,2 1,4 4,5 2,0 2,5 and every array movement to a horizontal, diagonal or antidiagonal neighbor moves along an edge of this graph, with the array starting at 0.at n=26A223504
• Petersen graph (3,1) coloring a rectangular array: number of 6Xn 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,3 3,5 3,4 1,2 1,4 4,5 2,0 2,5 and every array movement to a horizontal, diagonal or antidiagonal neighbor moves along an edge of this graph, with the array starting at 0.at n=1A223509