The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A358612 Irregular table T(n, k), n >= 0, k > 0, read by rows of extended (due to binary expansion of n) Stirling numbers of the second kind. 2
1, 1, 1, 3, 1, 1, 5, 2, 1, 7, 6, 1, 1, 9, 4, 1, 11, 11, 2, 1, 13, 15, 3, 1, 15, 25, 10, 1, 1, 17, 8, 1, 19, 21, 4, 1, 21, 28, 6, 1, 23, 44, 19, 2, 1, 25, 39, 9, 1, 27, 58, 27, 3, 1, 29, 68, 34, 4, 1, 31, 90, 65, 15, 1, 1, 33, 16, 1, 35, 41, 8, 1, 37, 54, 12, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
COMMENTS
Let U(n,m) = A329369(2*(A054429(n + 2^(A000523(n) + 1)) + 2^(A000523(n) + 2)*(2^m - 1))).
Experiments with WolframAlpha lead us to conjecture (which we subsequently check on a large number of values) that
U(n,m) = Sum_{k=1..wt(n) + 2} k!*k^(m+1)*R(n, k)*(-1)^(wt(n) - k + 2) for n > 0, m >= 0 where wt(n) = A000120(n) and where R(n, k) are unknown coefficients.
Then T(n,k) = R(A059893(n), k).
Row n length is A000120(n) + 2.
LINKS
FORMULA
T(n, 1) = 1 for n > 0 with T(0, 1) = T(0, 2) = 1.
T(2n+1, k) = k*T(n, k) + T(n, k-1) for n >= 0, k > 1.
T(2n, k) = k*T(n, k) + T(n, k-1) - (T(2n, k-1) + T(n, k-1))/(k-1) for n > 0, k > 1.
T(2^n - 1, k) = Stirling2(n+2, k) for n >= 0, k > 0.
T(n, 2) = 2n+1 for n >= 0.
T(n, A000120(n) + 2) = A341392(n) for n >= 0.
Sum_{k=1..wt(n) + 2} k!*T(n, k)*(-1)^(wt(n) - k + 2) = A329369(n) for n >= 0 where wt(n) = A000120(n).
Sum_{k=1..wt(f(n)) + 2} k!*k^(A290255(A054429(n)) + 1)*T(A059893(f(n)), k)*(-1)^(wt(f(n)) - k + 2) = A329369(2n) for n > 0, A053645(n+1) > 0 where wt(n) = A000120(n) and where f(n) = A035327(n).
EXAMPLE
Irregular table begins:
1, 1;
1, 3, 1;
1, 5, 2;
1, 7, 6, 1;
1, 9, 4;
1, 11, 11, 2;
1, 13, 15, 3;
1, 15, 25, 10, 1;
1, 17, 8;
1, 19, 21, 4;
1, 21, 28, 6;
1, 23, 44, 19, 2;
1, 25, 39, 9;
1, 27, 58, 27, 3;
1, 29, 68, 34, 4;
1, 31, 90, 65, 15, 1;
PROG
(PARI) T(n, k)=if(n==0 || k==1, (n==0 && k<3) + (k==1 && n>0), k*T(n\2, k) + T(n\2, k-1) - if(n%2==0, (T(n, k-1) + T(n\2, k-1))/(k-1)))
CROSSREFS
Similar tables: A358631.
Sequence in context: A076334 A348641 A014475 * A320436 A135228 A021325
KEYWORD
nonn,base,tabf
AUTHOR
Mikhail Kurkov, Nov 23 2022 [verification needed]
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 13 17:28 EDT 2024. Contains 372522 sequences. (Running on oeis4.)