Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A120911
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A120911 Triangle read by rows where t(n,m) is the (floor(n/m))th integer from among those positive integers not occurring earlier in the sequence. +0
3
1, 3, 2, 6, 4, 5, 10, 8, 7, 9, 15, 12, 11, 13, 14, 21, 18, 17, 16, 19, 20, 28, 24, 23, 22, 25, 26, 27, 36, 32, 30, 31, 29, 33, 34, 35, 45, 40, 39, 38, 37, 41, 42, 43, 44, 55, 50, 48, 47, 49, 46, 51, 52, 53, 54, 66, 60, 58, 57, 59, 56, 61, 62, 63, 64, 65, 78, 72, 70, 69, 68, 71 (list; table; graph; listen)
OFFSET

1,2

FORMULA

T(n,k) = n(n-1)/2 + U(n,k), where U(n,1) = n, U(n,k) = k-1 if floor(n/k) = floor(n/(k-1)), otherwise U(n,k) = floor(n/k). - Frank Adams-Watters (FrankTAW(AT)Netscape.net), Jul 25 2006

CROSSREFS

Cf. A120912, A120913.

Adjacent sequences: A120908 A120909 A120910 this_sequence A120912 A120913 A120914

Sequence in context: A084498 A066182 A059399 this_sequence A064789 A093050 A054089

KEYWORD

easy,nonn,tabl

AUTHOR

Leroy Quet (qq-quet(AT)mindspring.com), Jul 15 2006

EXTENSIONS

More terms from Frank Adams-Watters (FrankTAW(AT)Netscape.net), Jul 25 2006

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 October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research