19196

Appears in sequences

• Number of partitions of n that do not contain 1 as a part.at n=47A002865
• Cycle class sequence c(2n) (the number of true cycles of length 2n in which a certain node is included) for zeolite AFY = CoAPO-50 R3[Co3Al5P8O32].7H2O starting with a T1 atom.at n=6A018973
• Convolution of A001950 with itself.at n=24A023667
• a(n) = T(2n-1,n-1) = T(2n,n+1), T given by A026725.at n=7A026674
• a(n) = T(n, floor(n/2)), T given by A026670.at n=15A026676
• Greatest number in row n of array T given by A026725.at n=15A026731
• Numbers whose base-3 representation contains exactly one 0 and no 1's.at n=31A044970
• Numbers k such that k and k+1 have the same sum of non-unitary divisors (A048146), for A048146(k) > 0.at n=4A064115
• Trajectory of n under the Reverse and Add! operation carried out in base 3 (presumably) does not reach a palindrome and (presumably) does not join the trajectory of any term m < n.at n=39A077405
• Sum of terms in periodic part of continued fraction expansion of square root of 1+3^n.at n=14A077630
• Number of partitions of n including 3, but not 1.at n=49A085811
• Number of partitions of n in which both smallest and largest part occur only once.at n=46A117995
• Expansion of 1/(1-x*c(x)^3), c(x) the g.f. of A000108.at n=8A165201
• Expansion of 1/(1-x-x^3*c(x^3)), c(x) the g.f. of A000108.at n=23A165407
• Bisection (odd part) of number of partitions that do not contain 1 as a part A002865.at n=23A182747
• Number of partitions of n that do not contain parts less than the smallest part of the partitions of n-1.at n=46A187219
• Number of 3-step self-avoiding walks on an n X n square summed over all starting positions.at n=40A188148
• Number of squares between powers of 2, floor(sqrt(2^(n+1))) - floor(sqrt(2^n)).at n=32A190568
• Riordan array (1/(1-x*C(x)^3), x*C(x)), C(x) the g.f. of A000108.at n=36A236830
• Riordan array (1/(1-x*C(x)^3), x*C(x)), C(x) the g.f. of A000108.at n=58A236830