34344
domain: N
Appears in sequences
- 9 times octagonal numbers: a(n) = 9*n*(3*n-2).at n=36A064201
- Triangle, read by rows, equal to the matrix cube of triangle A113389.at n=10A113394
- Column 0 of triangle A113394, which equals the matrix cube of A113389.at n=4A113395
- Having specified two initial terms, the "Half-Fibonacci" sequence proceeds like the Fibonacci sequence, except that the terms are halved before being added if they are even.at n=38A120424
- Triangle read by rows: T(n,k) = 2^k*A123125(n,k).at n=39A141660
- G.f. satisfies: A(x) = 1 + Sum_{n>=1} q^(2n-1)/(1 - q^(2n-1)) where q = x*A(x).at n=10A190790
- The generalized Conway-Guy sequence w^{4}.at n=17A195683
- Number of nX3 0..3 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of elements above it, modulo 4.at n=3A239042
- Number of n X 4 0..3 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of elements above it, modulo 4.at n=2A239043
- T(n,k)=Number of nXk 0..3 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of the elements above it, modulo 4.at n=17A239047
- T(n,k)=Number of nXk 0..3 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of the elements above it, modulo 4.at n=18A239047
- Number of nX7 0..2 arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling two exactly once.at n=1A268903
- T(n,k)=Number of nXk 0..2 arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling two exactly once.at n=29A268904
- Number of 2 X n 0..2 arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling two exactly once.at n=6A268905
- Numbers m such that sigma(m)*tau(m) is a square but sigma(m)/tau(m) is not an integer.at n=11A327831