Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A088673
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A088673 n mod A002024(n), where A002024 is "n appears n times": 1, 2, 2, 3, 3, 3, ... +0
1
0, 0, 1, 1, 2, 0, 3, 0, 1, 2, 1, 2, 3, 4, 0, 4, 5, 0, 1, 2, 3, 1, 2, 3, 4, 5, 6, 0, 5, 6, 7, 0, 1, 2, 3, 4, 1, 2, 3, 4, 5, 6, 7, 8, 0, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 0, 7, 8, 9, 10, 11, 0, 1, 2, 3, 4, 5, 6, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 0, 8, 9, 10, 11, 12, 13, 0, 1, 2 (list; graph; listen)
OFFSET

0,5

EXAMPLE

a(7) = 3: A002024(7) = 4 and 7 mod 4 = 3.

CROSSREFS

Cf. A002024.

Sequence in context: A079067 A160271 A065134 this_sequence A035614 A133735 A095704

Adjacent sequences: A088670 A088671 A088672 this_sequence A088674 A088675 A088676

KEYWORD

nonn,easy

AUTHOR

Gary W. Adamson (qntmpkt(AT)yahoo.com), Oct 04 2003

EXTENSIONS

Corrected and extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Oct 04 2003

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 November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research