Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A072166
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A072166
%S A072166 1,3,5,7,10,13,17,21,25,29,31,36,41,46,51,55,61,67,73,79,85,92,99,106,
%T A072166 113,120,127,134,137,145,153,161,169,177,185,193,199,208,217,226,235,
%U A072166 244,253,262,271,281,291,301,311,321,331,341,351,361,371,375,386,397
%N A072166 Triangle in which first row is {1}; to get n-th row take first n numbers 
               greater than last number in previous row which are congruent to 1 
               (mod n).
%t A072166 a = {1}; k = 2; Do[i = 1; While[i < n + 1, If[ Mod[k, n] == 1, a = Append[a, 
               k]; i++ ]; k++ ], {n, 2, 11}]; a
%Y A072166 Cf. A071977 & A072467.
%Y A072166 Sequence in context: A001768 A089108 A029899 this_sequence A077000 A057672 
               A112509
%Y A072166 Adjacent sequences: A072163 A072164 A072165 this_sequence A072167 A072168 
               A072169
%K A072166 nonn
%O A072166 1,2
%A A072166 Robert G. Wilson v (rgwv(AT)rgwv.com), Jun 28 2002

    
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 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research