51150
domain: N
Appears in sequences
- Maximum cycle length in differentiation digraph for n-bit binary sequences.at n=49A038553
- Structured truncated dodecahedral numbers.at n=14A100153
- a(n) = floor((2^n)/(2n-1)).at n=20A191631
- (1/n)*A204991(n).at n=40A204992
- Dates after Jan 01 00 in chronological order which are palindromic when they are written in the format DD.MM.YY. The terms are listed as numbers (without the dots). Leading zeros of the terms are suppressed.at n=15A210888
- Dates after Jan 01 00 in chronological order which are palindromic when they are written according to the format MMDDYY (American standard, short). Leading zeros of the terms are suppressed.at n=14A210895
- Number of ordered triples (w,x,y) with all terms in {-n,...-1,1,...,n} and w+x+y>2.at n=24A211614
- Expansion of Product_{k>=1} ((1 + 2*x^k) * (1 + 3*x^k)).at n=17A266820
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 7", based on the 5-celled von Neumann neighborhood.at n=41A270012
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 7", based on the 5-celled von Neumann neighborhood.at n=42A270012
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 261", based on the 5-celled von Neumann neighborhood.at n=42A271062
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 337", based on the 5-celled von Neumann neighborhood.at n=42A271287
- Number of subsets of {1, 3, ..., 2*n-1} which sum to 0 modulo 2*n-1.at n=20A334125
- a(n) is the number in the first column of the Trithoff (tribonacci) array that starts off the row containing the tail of n times the tribonacci sequence.at n=29A351689