[go: up one dir, main page]

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!)
A125605 Triangle read by rows: T(n,k) = (T(n-1,k-1) + T(n-1,k)) / gcd(T(n-1,k-1), T(n-1,k)). 4
1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 4, 2, 4, 1, 1, 5, 3, 3, 5, 1, 1, 6, 8, 2, 8, 6, 1, 1, 7, 7, 5, 5, 7, 7, 1, 1, 8, 2, 12, 2, 12, 2, 8, 1, 1, 9, 5, 7, 7, 7, 7, 5, 9, 1, 1, 10, 14, 12, 2, 2, 2, 12, 14, 10, 1, 1, 11, 12, 13, 7, 2, 2, 7, 13, 12, 11, 1, 1, 12, 23, 25, 20, 9, 2, 9, 20, 25, 23, 12, 1, 1, 13 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
0,5
COMMENTS
Row A264856(n) contains the first occurrence of n, n > 0. - Reinhard Zumkeller, Nov 26 2015
LINKS
PROG
(Haskell)
a125605 n k = a125605_tabl !! n !! k
a125605_row n = a125605_tabl !! n
a125605_tabl = iterate f [1] where
f xs = zipWith (\v w -> (v + w) `div` gcd v w) ([0] ++ xs) (xs ++ [0])
-- Reinhard Zumkeller, Nov 26 2015
CROSSREFS
Cf. A040000 (central terms), A131134, A264856.
Sequence in context: A177974 A095140 A225043 * A110570 A341314 A335174
KEYWORD
nonn,tabl
AUTHOR
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 August 29 18:55 EDT 2024. Contains 375518 sequences. (Running on oeis4.)