Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A004736
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A004736 Triangle T(n,k) = n-k, n >= 1, 0<=k<n. Fractal sequence formed by repeatedly appending strings m m-1 . . . 2 1. +0
48
1, 2, 1, 3, 2, 1, 4, 3, 2, 1, 5, 4, 3, 2, 1, 6, 5, 4, 3, 2, 1, 7, 6, 5, 4, 3, 2, 1, 8, 7, 6, 5, 4, 3, 2, 1, 9, 8, 7, 6, 5, 4, 3, 2, 1, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 14, 13, 12, 11, 10, 9 (list; table; graph; listen)
OFFSET

1,2

COMMENT

"Smarandache Decrescendo Subsequences".

The PARI functions t1, t2 can be used to read a square array T(n,k) (n >= 1, k >= 1) by antidiagonals upwards: n -> T(t1(n), t2(n)). - Michael Somos, Aug 23, 2002

REFERENCES

C. Kimberling, "Numeration systems and fractal sequences," Acta Arithmetica 73 (1995) 103-117.

F. Smarandache, "Collected Papers", Vol. II, Tempus Publ. Hse., Bucharest, 1996; F. Smarandache, "Numerical Sequences", University of Craiova, 1975; [ See Arizona State University, Special Collection, Tempe, AZ, USA ].

F. Smarandache, Sequences of Numbers Involved in Unsolved Problems, Hexis, Phoenix, 2006.

LINKS

C. Kimberling, Fractal sequences

M. L. Perez et al., eds., Smarandache Notions Journal

F. Smarandache, Collected Papers, Vol. II

F. Smarandache, Sequences of Numbers Involved in Unsolved Problems.

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

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

FORMULA

a(n) = (2 - 2 n + round(SQRT(2 n)) + round(SQRT(2 n))^2)/2. E.g. a(47) = 9. - Brian Tenneson (phoenix(AT)alephnulldimension.net), Oct 11 2003

G.f.: 1 / [(1-x)^2 * (1-xy) ]. - R. Stephan, Jan 23 2005

EXAMPLE

1; 2,1; 3,2,1; 4,3,2,1; 5,4,3,2,1; ...

MATHEMATICA

Flatten[ Table[ Reverse[ Range[n]], {n, 12}]] (from Robert G. Wilson v Apr 27 2004)

PROGRAM

(PARI) a(n)=1+binomial(1+floor(1/2+sqrt(2*n)), 2)-n

(PARI) t1(n)=binomial(floor(3/2+sqrt(2*n)), 2)-n+1 /* A004736 */

(PARI) t2(n)=n-binomial(floor(1/2+sqrt(2*n)), 2) /* A002260 */

CROSSREFS

a(n+1)=1+A025581(n). Cf. A002262, A025581, A003056.

Ordinal transform of A002260.

Adjacent sequences: A004733 A004734 A004735 this_sequence A004737 A004738 A004739

Sequence in context: A057058 A088643 A102482 this_sequence A023122 A052310 A052313

KEYWORD

nonn,easy,tabl,nice

AUTHOR

R. Muller

page 1

Search completed in 0.003 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 9 14:06 EDT 2008. Contains 144831 sequences.


AT&T Labs Research