"More" Sequences: was Re: Duplicate hunting

[Maximilian Hasler]

On 5/10/07, Leroy Quet <qq-quet at mindspring.com> wrote:
> Let me take this opportunity to point out that there are almost 600
> pages(!) of sequences that have keyword:more. Having these sequences
> extended would possibly cut down on the number of dupicates too.
>
> There are 22 pages of sequences originally submitted by me, for instance,
> that have keyword:more.

well, this means that there are less than 30 contributors of your type...

> terms out by hand. I usually do not have confidence enough to calculate
> my sequences much past 12 or so terms.

It occurs to me that I look for "keyword:more" and extend interesting
sequences, e.g. A056637.
However, the first sequences I get for "keyw:more author:quet" are the
following, (where "order" means "index" and "compute" means to look up
the index "n" of a number which is by definition in  sequence { a(n)
}.

A112929
 	 a(n) = order of n-th term of A112925 among squarefree integers.
	1, 2, 3, 5, 7, 8, 11, 12, 15, 17, 19

	EXAMPLE
The 5th term of A112925 is 10, and 10 is the 7th squarefree integer
(with 1 counted as the first squarefree integer). So a(5) = 7.

	KEYWORD 	more,nonn
	AUTHOR 	Leroy Quet (qq-quet(AT)mindspring.com), Oct 06 2005

A112930
	a(n) = order of n-th term of A112926 among squarefree integers.

	3, 4, 5, 7, 9, 10, 13, 14, 17, 19, 21 (list; graph; listen)

	EXAMPLE
The 5th term of A112926 is 13, and 13 is the 9th squarefree integer
(with 1 counted as the first squarefree integer). So a(5) = 9.

	KEYWORD 	more,nonn
	AUTHOR 	Leroy Quet (qq-quet(AT)mindspring.com), Oct 06 2005

A127915
	a(1)=1, a(2)=2. For n >= 3, a(n) is the smallest positive integer not
occurring earlier in the sequence such that floor(a(n)/a(n-1)) does
not equal floor(a(n-1)/a(n-2)).

	1, 2, 3, 6, 4, 5, 10, 7, 8, 16, 9, 11, 22, 12, 13, 26, 14, 15, 30,
17, 18, 36, 19, 20

	COMMENT This sequence is a permutation of the positive integers.
	KEYWORD 	more,nonn
	AUTHOR 	Leroy Quet (qq-quet(AT)mindspring.com), Apr 06 2007

A115208
	a(1)=0. a(n) = number of earlier terms of the sequence which when
added to n produce a composite number.
	0, 0, 0, 3, 1, 4, 2, 6, 6, 7 (list; graph; listen)

	EXAMPLE 	
Adding 7 to the first 6 terms of the sequence gives [7,7,7,10,8,11].
Of these terms, two are composite, so a(7) = 2.

	KEYWORD 	more,nonn
	AUTHOR 	Leroy Quet (qq-quet(AT)mindspring.com), Jan 16 2006

A115209 		a(0)=1. a(n) = number of earlier terms of the sequence which
when added to n produce a composite number. 		+0
4
	1, 0, 0, 1, 2, 2, 4, 4, 8, 4, 8

*************