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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A096320 a(n) = (n^2+n+4)/2, modulo 10. 1
2, 3, 5, 8, 2, 7, 3, 0, 8, 7, 7, 8, 0, 3, 7, 2, 8, 5, 3, 2, 2, 3, 5, 8, 2, 7, 3, 0, 8, 7, 7, 8, 0, 3, 7, 2, 8, 5, 3, 2, 2, 3, 5, 8, 2, 7, 3, 0, 8, 7, 7, 8, 0, 3, 7, 2, 8, 5, 3, 2, 2, 3, 5, 8, 2, 7, 3, 0, 8, 7, 7, 8, 0, 3, 7, 2, 8, 5, 3, 2, 2, 3, 5, 8, 2, 7, 3, 0, 8, 7, 7, 8, 0, 3, 7, 2, 8, 5, 3, 2, 2, 3, 5, 8, 2 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

COMMENTS

This periodic sequence equals A008954(n)+2 modulo 10 and also A061501(n+1)+1 modulo 10.

CROSSREFS

Cf. A008954, A061501.

Sequence in context: A089911 A098978 A111301 * A105955 A003893 A152303

Adjacent sequences:  A096317 A096318 A096319 * A096321 A096322 A096323

KEYWORD

nonn,easy,less

AUTHOR

Cino Hilliard (hillcino368(AT)gmail.com), Aug 02 2004

EXTENSIONS

Edited by Don Reble (djr(AT)nk.ca), Apr 16 2007

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 February 17 02:08 EST 2012. Contains 205978 sequences.