login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A340881
Row sums of A340880.
2
1, 3, 17, 183, 3769, 149607, 11522393, 1731779367, 510323215321, 295959535117863, 338795401444537817, 767301163051807117863, 3444329717600807441325529, 30688384795438974301695656487, 543332627310980056832574442798553
OFFSET
1,2
COMMENTS
Conjectures: 1) For prime p, the sequence taken modulo p is purely periodic with minimum period dividing 2*(p - 1). For example, taken modulo 5 the sequence becomes [1, 3, 2, 3, 4, 2, 3, 2, 1, 3, 2, 3, 4, 2, 3, 2, ...], which appears to be a purely periodic sequence of period 8.
2) For composite n, the sequence taken modulo n is eventually periodic. For example, taken modulo 24 the sequence becomes [1, 3, 17, 15, 1, 15, 17, 15, 1, 15, 17, 15, 1, 15, ...], apparently with pre-period 2 and period 4.
FORMULA
a(n) = Sum_{k = 0..n-1} 2^(k*(k+1)/2)*( Product_{j = k+1..n-1} 2^j - 1 ).
MAPLE
a := n -> add( 2^((1/2)*k*(k+1))*mul(2^j-1, j = k+1..n-1), k = 0..n-1 ):
seq(a(n), n = 1..20);
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Peter Bala, Feb 16 2021
STATUS
approved