Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A152009
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A152009 (L)-sieve transform of {1,4,7,10,...,3n-2,...} (A016777) +0
6
1, 3, 6, 10, 16, 25, 39, 60, 91, 138, 208, 313, 471, 708, 1063, 1596, 2395, 3594, 5392, 8089, 12135, 18204, 27307, 40962, 61444, 92167 (list; graph; listen)
OFFSET

1,2

COMMENT

The (L)-sieve transform of the sequence {a(n)} of positive integers is defined as follows: Denote the sequence of natural numbers by N. Remove the first term of N, which we denote by s(1) and then from the resulting sequence delete all terms whose index is a term of {a(n)}, to obtain the sequence N'.

Then remove the first term of N', denoted by s(2) and then from the resulting sequence delete all terms whose index is a term of {a(n)}, to obtain N''. Repeat this process indefinitely to obtain the transform LST({a(n)}) = {s(1), s(2),...}, the sequence of initial terms removed at each stage.

The (L)-sieve transform is quite different from the transform introduced by N. J. A. Sloane in A099361 and used by T. D. Noe in A100424 - A100426 and seems to lead to more interesting results and relationships among sequences. An interesting property of the (L)-sieve transform is that the (L)-sieve transform of the sequence {1,3,6,10,...,n(n+1)/2,...} of triangular numbers is again the triangular numbers. Another (conjectured) connection with the triangular numbers is given in the following. Conjecture. Let x(0) be a random sequence of positive integers and, for n>0, let x(n)=S[x(n-1)], where S is the (L)-sieve transform.

Then the limit of {x(n)} as n goes to infinity is the sequence of triangular numbers {1,3,6,10,...,n(n+1)/2,...}. Illustrating of the conjecture: x(0)={3,8,12,14,18,22,25,31,34,39,42,45,...} (A random initial sequence.) x(1)={1,2,3,5,7,10,14,20,28,38,51,69,...} x(2)={1,5,12,20,30,41,53,65,78,91,105,119,...} x(3)={1,3,5,8,11,15,19,24,29,35,41,48,...} x(4)={1,3,7,13,21,31,43,56,71,88,107,127,...} x(5)={1,3,6,10,15,20,26,33,40,48,56,65,...} x(6)={1,3,6,10,15,22,30,39,50,62,75,90,...} x(7)={1,3,6,10,15,21,28,36,45,55,66,78,...} ... t={1,3,6,10,15,21,28,36,45,55,66,78,...} (Triangular numbers)

FORMULA

It appears that {a(n)} is given by a(n)=Floor[(3*a(n-1)+3)/2], with a(1)=1.

CROSSREFS

Sequence in context: A011902 A025004 A145131 this_sequence A114324 A054886 A130578

Adjacent sequences: A152006 A152007 A152008 this_sequence A152010 A152011 A152012

KEYWORD

nonn

AUTHOR

John W. Layman (layman(AT)math.vt.edu), Nov 19 2008

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 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research