Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Revision History for A145515

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Square array A(n,k), n>=0, k>=0, read by antidiagonals: A(n,k) is the number of partitions of k^n into powers of k.
(history; published version)
#30 by Alois P. Heinz at Tue Mar 19 12:47:42 EDT 2019
LINKS

Valentin P. Bakoev, <a href="https://www.researchgate.net/publication/222349380_Algorithmic_approach_to_counting_of_certain_types_m-ary_partitions">Algorithmic approach to counting of certain types m-ary partitions</a>. Article describes polynomial by n algorithm to count k-ary partitions of k^n.

KEYWORD

nonn,tabl,changed

STATUS

editing

approved

#29 by Alois P. Heinz at Tue Mar 19 12:47:37 EDT 2019
STATUS

proposed

editing

#28 by Serguei Zolotov at Tue Mar 19 11:07:01 EDT 2019
STATUS

editing

proposed

Discussion
Tue Mar 19
12:18
Michel Marcus: why not use this link : https://doi.org/10.1016/S0012-365X(03)00096-7 ?
12:47
Alois P. Heinz: This algorithm was not used for this sequence.  If you used this algorithm, please add the link to your own (latest) seuence.
#27 by Serguei Zolotov at Tue Mar 19 11:06:15 EDT 2019
LINKS

Valentin P. Bakoev, <a href="https://www.researchgate.net/publication/222349380_Algorithmic_approach_to_counting_of_certain_types_m-ary_partitions">Algorithmic approach to counting of certain types m-ary partitions</a>. Article describes polynomial by n algorithm to count k-ary partitions of k^n.

STATUS

approved

editing

Discussion
Tue Mar 19
11:07
Serguei Zolotov: Added link to the article.
#26 by Alois P. Heinz at Thu Oct 04 20:09:18 EDT 2018
STATUS

editing

approved

#25 by Alois P. Heinz at Thu Oct 04 20:08:58 EDT 2018
EXAMPLE

1, 1, 1, 1, 1, 1, ...

1, 1, 2, 2, 2, 2, ...

1, 1, 4, 5, 6, 7, ...

1, 1, 10, 23, 46, 82, ...

1, 1, 36, 239, 1086, 3707, ...

1, 1, 202, 5828, 79326, 642457, ...

STATUS

approved

editing

#24 by Alois P. Heinz at Thu Dec 14 15:47:54 EST 2017
STATUS

editing

approved

#23 by Alois P. Heinz at Fri Nov 17 05:05:22 EST 2017
CROSSREFS

Columns k=0+1, 2-10 give: A000012, A002577, A078125, A078537, A111822, A111827, A111832, A111837, A145512, A145513. Diagonal gives: A145514. Row 3 gives: A189890(k+1). Cf. A007318.

Row n=3 gives: A189890(k+1).

Main diagonal gives: A145514.

Cf. A007318.

STATUS

approved

editing

Discussion
Fri Dec 08
21:12
OEIS Server: This sequence has not been edited or commented on for a week
yet is not proposed for review.  If it is ready for review, please
visit https://oeis.org/draft/A145515 and click the button that reads
"These changes are ready for review by an OEIS Editor."

Thanks.
  - The OEIS Server
#22 by Alois P. Heinz at Sun Oct 19 09:49:18 EDT 2014
STATUS

editing

approved

#21 by Alois P. Heinz at Sun Oct 19 09:49:06 EDT 2014
MAPLE

elif n>=j then (nn-j) *binomial(nn, j) *add (binomial(j, h)

seq (seq (A(n, d-n), n=0..d), d=0..13);

STATUS

approved

editing