Paolo Xausa, <a href="/A151923/b151923_1.txt">Table of n, a(n) for n = 0..10000</a>
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Paolo Xausa, <a href="/A151923/b151923_1.txt">Table of n, a(n) for n = 0..10000</a>
proposed
approved
editing
proposed
a(n) = A079316(2n+1).
proposed
editing
editing
proposed
3, 7, 11, 21, 25, 35, 45, 73, 77, 87, 97, 125, 135, 163, 191, 273, 277, 287, 297, 325, 335, 363, 391, 473, 483, 511, 539, 621, 649, 731, 813, 1057, 1061, 1071, 1081, 1109, 1119, 1147, 1175, 1257, 1267, 1295, 1323, 1405, 1433, 1515, 1597, 1841, 1851, 1879, 1907
Paolo Xausa, <a href="/A151923/b151923_1.txt">Table of n, a(n) for n = 0..10000</a>
A151923list[nmax_]:=Accumulate[3^DigitCount[Range[0, nmax], 2, 1]+1]+1; A151923list[100] (* Paolo Xausa, Jul 28 2023 *)
More terms from Paolo Xausa, Jul 28 2023
approved
editing
_N. J. A. Sloane (njas(AT)research.att.com), _, Aug 05 2009
A079316(2n+1).
3, 7, 11, 21, 25, 35, 45, 73, 77, 87, 97, 125, 135, 163, 191, 273, 277, 287, 297, 325, 335, 363, 391, 473, 483, 511, 539, 621, 649, 731
0,1
First differences give A151712.
nonn,easy
N. J. A. Sloane (njas(AT)research.att.com), Aug 05 2009
approved