Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A100775
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A100775
%S A100775 101,198,295,392,489,586,683,780,877,974,1071,1168,1265,1362,1459,1556,
%T A100775 1653,1750,1847,1944,2041,2138,2235,2332,2429,2526,2623,2720,2817,2914,
%U A100775 3011,3108,3205,3302,3399,3496,3593,3690,3787,3884,3981,4078,4175,4272
%N A100775 a(n) = 97*n + 101.
%C A100775 Note that 97 is the largest two-digit prime and 101 is the smallest three-digit 
               prime.
%H A100775 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/
               RecursiveSequences.html">Recursive Sequences</a>
%e A100775 If n=1, then 97*1 + 101 = 198
%Y A100775 Cf. A101084, A017029, A100776, A101442.
%Y A100775 Sequence in context: A076613 A045978 A141913 this_sequence A044333 A044714 
               A158128
%Y A100775 Adjacent sequences: A100772 A100773 A100774 this_sequence A100776 A100777 
               A100778
%K A100775 nonn,easy
%O A100775 0,1
%A A100775 Parthasarathy Nambi (PachaNambi(AT)yahoo.com), Jan 03 2005
%E A100775 More terms from C. Ronaldo (aga_new_ac(AT)hotmail.com), Jan 19 2005
%E A100775 Edited by Ray Chandler (rayjchandler(AT)sbcglobal.net), Jan 25 2005

    
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 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research