38 Parrots

38 Parrots (Russian: 38 попугаев, translit. Tridtsat vosem popugaev) is a series of ten children's cartoons produced in the Soviet Union between 1976 and 1991 by Soyuzmultfilm. Featuring animated puppets, the series portrays the amusing adventures of four friends: the talkative marmoset Martyshka, the shy young elephant Slonionok, the eccentric parrot Popugai, and the thoughtful boa Udav.

38 Parrots
Written byGrigoriy Oster
Directed byIvan Ufimtsev
StarringNadezhda Rumiantseva
Mikhail Kozakov
Vasily Livanov
Vsevolod Larionov
Music byGennady Gladkov
Yuri Entin
Country of originSoviet Union
Original language(s)Russian
Production
Producer(s)Soyuzmultfilm
Release
Original release1976, 1977
1978, 1979
1985, 1991

The title of the series comes from the very first episode, where Udav has his length measured in parrots. In most episodes the heroes solve paradoxes related to language and meaning. In one, for example, they discuss the number of nuts it takes to make a whole pile. In another, they tackle the problem of how to convey a greeting without it disappearing in transit.

The series was created by director Ivan Ufimtsev and artist Leonid Shvartsman, and scripted by children's author Grigoriy Oster. The characters were voiced by popular actors Nadezhda Rumiantseva (Martyshka), Mikhail Kozakov (Slonionok), Vasilii Livanov (Udav) and Vsevolod Larionov (Popugai). The series includes songs by Gennadii Gladkov and Yuri Entin.

List of episodes
  • "38 Parrots" / 38 попугаев (July 13, 1976)
  • "Udav's Grandmother" / Бабушка удава (April 20, 1977)
  • "How to Cure Udav" / Как лечить удава (July 5, 1977)
  • Where is Slonenok Going" / Куда идёт слонёнок (September 19, 1977)
  • "And What if It Works!" / А вдруг получится! (February 14, 1978)
  • "Hello to Martyshka" / Привет мартышке (June 18, 1978)
  • "Tomorrow Will be Tomorrow" / Завтра будет завтра (May 5, 1979)
  • "Gymnastics for the Tail" / Зарядка для хвоста (November 27, 1979)
  • "The Great Covery" / Великое закрытие (January 30, 1985)
  • "Unobvious Textbook" / Ненаглядное пособие (August 15, 1991)
gollark: Finding the longest path is easy. Find the shortest one and don't do it.
gollark: Even if they did run in their own thread, imagine how horrendously inefficiently some players would program without it.
gollark: It's all that stands between us and even worse code.
gollark: What limit? Too long without yielding?
gollark: Shrines?

See also


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.