login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A172984 Sequence congruent to the Fibonacci sequence modulo 5, with 1 added to the last term. Seen on "Mathnet" 0
1, 1, 2, 3, 5, 3, 3, 1, 4, 5, 4, 4, 3, 2, 5, 2, 2, 4, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

This sequence was used as a puzzle in the "Mathnet" portion of the children's mathematics television show Square One TV. In the series "Case of the Willing Parrot" (Episodes 201-205), the sequence was found on a tile wall. The mystery was solved by the discovery of the sequence and a key behind the final term.

REFERENCES

Schneider, Joel, et al., Square One TV: Season Two Content Analysis and Show Rundowns. 21 Jul 1988, Children's Television Workshop; New York.

LINKS

Table of n, a(n) for n=0..18.

Children's Television Workshop, Mathnet - Case of the Willing Parrot (Recap & Finale) Pt.2

Schneider, Joel, et al, Mathnet Guide

FORMULA

F(n) = (F(n-1) + F(n-2)) mod 5 for n=/= 18, F(19)=(F(n-1) + F(n-2)+1) mod 5 , F(0) = 0, F(1) = 1, F(2) = 1

CROSSREFS

A000045

Sequence in context: A202694 A123221 A197032 * A072751 A131971 A100742

Adjacent sequences:  A172981 A172982 A172983 * A172985 A172986 A172987

KEYWORD

fini,full,nonn

AUTHOR

Jon Suen (jsuen(AT)ece.ucsb.edu), Feb 06 2010

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified May 23 23:31 EDT 2013. Contains 225613 sequences.