Recursive method for building Arnold's triangle X_p(a,b)

DOI10.1007/S11853-007-0007-7zbMATH Open1148.05003OpenAlexW1766708234MaRDI QIDQ952233FDOQ952233

Authors: Francesca Aicardi 

Publication date: 11 November 2008

Published in: Functional Analysis and Other Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11853-007-0007-7

Recommendations

• scientific article; zbMATH DE number 46604
• scientific article; zbMATH DE number 68564
• Pascal's triangle on a torus and on a binary tree
• scientific article; zbMATH DE number 3912461
• Subprime factorization and the numbers of binomial coefficients exactly divided by powers of a prime

zbMATH Keywords

binomial coefficientrecurrenceArnold's triangle

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Factorials, binomial coefficients, combinatorial functions (05A10) Recurrences (11B37)

Cites Work

• Title not available (Why is that?)

Cited In (1)

• Recursive method for building Arnold's triangle. II: Proofs and explicit formulas

This page was built for publication: Recursive method for building Arnold's triangle \(X_p(a,b)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q952233)