Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A072222
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A072222 a(n) = mod(abs(n-1-a(n-2)],n) + mod(abs(n-1-a(n-1)],n-1], a(0) = 1, a(1) = 1. +0
1
1, 1, 0, 1, 5, 4, 1, 7, 6, 3, 9, 8, 5, 11, 10, 7, 13, 12, 9, 15, 14, 11, 17, 16, 13, 19, 18, 15, 21, 20, 17, 23, 22, 19, 25, 24, 21, 27, 26, 23, 29, 28, 25, 31, 30, 27, 33, 32, 29, 35, 34, 31, 37, 36, 33, 39, 38, 35, 41, 40, 37, 43, 42, 39, 45, 44, 41, 47, 46, 43, 49, 48, 45, 51 (list; graph; listen)
page 1

Search completed in 0.001 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research