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
%I A088673
%S A088673 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,
%T A088673 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,
%U A088673 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
%N A088673 n mod A002024(n), where A002024 is "n appears n times": 1, 2, 2, 3, 3, 
               3, ...
%e A088673 a(7) = 3: A002024(7) = 4 and 7 mod 4 = 3.
%Y A088673 Cf. A002024.
%Y A088673 Sequence in context: A079067 A160271 A065134 this_sequence A035614 A133735 
               A095704
%Y A088673 Adjacent sequences: A088670 A088671 A088672 this_sequence A088674 A088675 
               A088676
%K A088673 nonn,easy
%O A088673 0,5
%A A088673 Gary W. Adamson (qntmpkt(AT)yahoo.com), Oct 04 2003
%E A088673 Corrected and extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), 
               Oct 04 2003

    
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 1 19:22 EST 2009. Contains 167811 sequences.


AT&T Labs Research