Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A073188
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A073188 n appears 1+[n/3] times. +0
1
0, 1, 2, 3, 3, 4, 4, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 11, 11, 11, 11, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 17, 17, 18, 18, 18, 18, 18, 18, 18, 19, 19, 19, 19, 19, 19 (list; graph; listen)
OFFSET

0,3

COMMENT

The PARI functions t1, t2 can be used to read a triangular array T(n,k) (n >= 0, 0 <= k <= floor(n/3)) by rows from left to right: n -> T(t1(n), t2(n)).

a(A001840(k) + j) = A001840(k), 0<=j<A008620(k). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 01 2002

LINKS

M. Somos, Sequences used for indexing triangular or square arrays

FORMULA

[sqrt(6n+6)-3/2]

PROGRAM

(PARI) a(n)=floor(sqrt(6*n+6)-3/2)

(PARI) t1(n)=floor(sqrt(6*n+6)-3/2) /* A073188 */

(PARI) t2(n)=(n-3*binomial(1+t1(n)\3, 2))%(t1(n)\3+1) /* A073189 */

CROSSREFS

Cf. A073189.

Adjacent sequences: A073185 A073186 A073187 this_sequence A073189 A073190 A073191

Sequence in context: A134995 A031247 A062575 this_sequence A047740 A137687 A024745

KEYWORD

nonn

AUTHOR

Michael Somos, Jul 19 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 October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research