114687

Appears in sequences

• a(n) = 2*a(n-2) + 1.at n=29A010737
• a(n) = Sum_{k=0..floor(n/2)} A026615(n, k).at n=17A026623
• Björner-Welker sequence: 2^n*(n^2 + n + 2) - 1.at n=10A055580
• a(n) = n*4^n - 1, with a(0) = 1.at n=7A060416
• Row sums in triangle A081994.at n=39A081997
• a(n) = 7*2^n - 1.at n=14A086224
• a(n) = (n+1) * 2^n - 1.at n=13A087323
• a(n) = prime(n) * 4^prime(n) - 1.at n=3A100689
• a(n) = p * (n^p) - 1 where p = prime(n).at n=3A100768
• a(n) = 7*4^n-1.at n=7A198694
• Positions of records in A249695.at n=18A249715
• If n is the i-th positive integer with binary weight j, then a(n) is the j-th positive integer with binary weight i.at n=43A263018
• Decimal representation of the middle column of the "Rule 175" elementary cellular automaton starting with a single ON (black) cell.at n=16A267604
• Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 51", based on the 5-celled von Neumann neighborhood.at n=32A285562
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 157", based on the 5-celled von Neumann neighborhood.at n=17A286119
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 561", based on the 5-celled von Neumann neighborhood.at n=16A289378
• a(n) = Sum_{k=0..n} binomial(3*n+1,k) * binomial(3*n-k,n-k).at n=5A383326
• Numbers k such that the odd part of (1+k) divides (1 + odd part of A034448(k)), where A034448 is unitary sigma (usigma).at n=23A387418