The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A123403 Combining the conditional divide-by-two concept from Collatz sequences with Pascal's triangle, we can arrive at a new kind of triangle. Start with an initial row of just 4. To compute subsequent rows, start by appending a zero to the beginning and end of the previous row. Like Pascal's triangle, add adjacent terms of the previous row to create each of the subsequent terms. The only change is that each term is divided by two if it is even. Then take the center of this triangle. In other words, take the n-th term from the (2n)th row. 0
 4, 2, 3, 5, 9, 15, 27, 25, 47, 89, 107, 119, 241, 545, 699, 1471, 3313, 4288, 15661, 31739, 30813, 35143, 92101, 123614, 384815, 788429, 1532363, 2995379, 6281191, 13569969, 16900339, 26062940, 28141406, 57780803, 122540851, 263162577 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Reed Kelly, Collatz-Pascal Triangle FORMULA Define a(n, m) for integers m, n: a(0, 0)=4, a(n, m) := 0 for m<0 and n

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.

Last modified April 2 00:42 EDT 2023. Contains 361723 sequences. (Running on oeis4.)