Significance Arithmetic: The Carrying Algorithm. - Nicholas C. Metropolis; Gian-Carlo Rota; Stephen M. Tanny (J. Comb. Theory A, 1973)

On a unimodal sequence of binomial coefficients. - Stephen M. Tanny; Michael Zuker (Discret. Math., 1974)

Generating functions and generalized alternating subsets. - Stephen M. Tanny (Discret. Math., 1975)

Permutations and Successions. - Stephen M. Tanny (J. Comb. Theory A, 1976)

Analytic methods applied to a sequence of binomial coefficients. - Stephen M. Tanny; Michael Zuker (Discret. Math., 1978)

Counting permutations by successions and other figures. - James W. Reilly; Stephen M. Tanny (Discret. Math., 1980)

A well-behaved cousin of the Hofstadter sequence. - Stephen M. Tanny (Discret. Math., 1992)

On a Strange Recursion of Golomb. - Ed Barbeau; Steve Tanny (Electron. J. Comb., 1996)

A Matrix Dynamics Approach to Golomb's Recursion. - Edward J. Barbeau; John J. Chew III; Stephen M. Tanny (Electron. J. Comb., 1997)

On the Behavior of a Family of Meta-Fibonacci Sequences. - Joseph Callaghan; John J. Chew III; Stephen M. Tanny (SIAM J. Discret. Math., 2005)

Trees and Meta-Fibonacci Sequences. - Abraham Isgur; David Reiss; Stephen M. Tanny (Electron. J. Comb., 2009)

Spot-Based Generations for Meta-Fibonacci Sequences. - Barnaby Dalton; Mustazee Rahman; Stephen M. Tanny (Exp. Math., 2011)

Nested Recurrence Relations with Conolly-like Solutions. - Alejandro Erickson; Abraham Isgur; Bradley W. Jackson; Frank Ruskey; Stephen M. Tanny (SIAM J. Discret. Math., 2012)

Nested Recursions, Simultaneous Parameters and Tree Superpositions. - Abraham Isgur; Vitaly Kuznetsov; Mustazee Rahman; Stephen M. Tanny (Electron. J. Comb., 2014)

Constructing New Families of Nested Recursions with Slow Solutions. - Abraham Isgur; Robert Lech; Scott Moore; Stephen M. Tanny; Yvon Verberne; Yifan Zhang (SIAM J. Discret. Math., 2016)