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”).

A245235
Repeat 2^(n*(n+1)/2) n+1 times.
1
1, 2, 2, 8, 8, 8, 64, 64, 64, 64, 1024, 1024, 1024, 1024, 1024, 32768, 32768, 32768, 32768, 32768, 32768, 2097152, 2097152, 2097152, 2097152, 2097152, 2097152, 2097152, 268435456, 268435456, 268435456, 268435456, 268435456, 268435456, 268435456, 268435456
OFFSET
0,2
COMMENTS
For a(n), the successive exponents of 2 are 0, 1, 1, 3, 3, 3,... = A057944(n).
FORMULA
a(n) = 2^n/A059268(n).
T(n, k) = 2^(n*(n+1)/2), 0 <= k <= n. - Michel Marcus, Jul 17 2014
EXAMPLE
n+1 times repeated 2^(n*(n+1)/2)= 1, 2, 8, 64, 1024,... = A139685(n).
By the formula: a(0)=1/1=1, a(1)=2/1=2, a(2)=4/2=2, a(3)=8/1=8, a(4)=16/2=8,...
As triangle:
1,
2, 2,
8, 8, 8,
64, 64, 64, 64,
1024, 1024, 1024, 1024, 1024,
etc.
Row sums: 1, 4, 24, 256,... = A095340.
MATHEMATICA
Table[2^(n*(n+1)/2), {n, 0, 7}, {n+1}] // Flatten (* Jean-François Alcover, Jul 15 2014 *)
PROG
(Python)
from math import isqrt
def A245235(n): return 1<<((m:=isqrt(n+1<<3)-1>>1)*(m+1)>>1) # Chai Wah Wu, Dec 17 2024
KEYWORD
nonn,tabl
AUTHOR
Paul Curtz, Jul 14 2014
STATUS
approved