Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A161916
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A161916 a(n) is the least k such that A010060(n+k)=A010060(n) +0
3
3, 1, 2, 2, 3, 1, 3, 1, 3, 1, 2, 2, 3, 1, 2, 2, 3, 1, 2, 2, 3, 1, 3, 1, 3, 1, 2, 2, 3, 1, 3, 1, 3, 1, 2, 2, 3, 1, 3, 1, 3, 1, 2, 2, 3, 1, 2, 2, 3, 1, 2, 2, 3, 1, 3, 1, 3, 1, 2, 2, 3, 1 (list; graph; listen)
OFFSET

0,1

COMMENT

For every nonnegative n there exists x=1,2 or 3 such that A010060(n+x)= A010060(n).

FORMULA

a(n)=1, if n is in A079523; a(n)=2, if n is in A081706; a(n)=3, if n is an even term of A161579.

CROSSREFS

A010060 A079523 A081706 A161879

Sequence in context: A085247 A003016 A108121 this_sequence A072548 A079399 A092155

Adjacent sequences: A161913 A161914 A161915 this_sequence A161917 A161918 A161919

KEYWORD

nonn,uned

AUTHOR

Vladimir Shevelev (shevelev(AT)bgu.ac.il), Jun 22 2009

page 1

Search completed in 0.002 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 7 23:50 EST 2009. Contains 170430 sequences.


AT&T Labs Research