[seqfan] Re: seqs whose |differences| are 1,2,3,4,...

[Ron Hardin]

I quit too soon, it does quite other things for >6

The smallest hole (after 100,000 terms) is for starting values in 1..100
5 7 11 15 19 23 2 1 2 1 2 3 1 2 3 2 3 6 1 8 3 4 1 12 16 6 7 2 1 3 5 5 6 1 1 2 15 1 4 9 6 7 1 1 1 2 1 6 1 12 7 1 2 1 2 2 3 4 5 23 7 8 9 10 1 2 2 3 4 5 6 7 15 13 10 1 1 1 1 20 1 1 8 7 8 9 20 11 1 1 23 7 3 1 5 24 1 14 9 1

If you start at 9, the escape computation gets very difficult (it's quite fast below that) around term index 290,000.


rhhardin at mindspring.com
rhhardin at att.net (either)



----- Original Message ----
> From: Ron Hardin <rhhardin at att.net>
> To: Sequence Fanatics Discussion list <seqfan at list.seqfan.eu>
> Sent: Sun, March 14, 2010 10:58:56 AM
> Subject: [seqfan] Re: seqs whose |differences| are 1,2,3,4,...
> 
> Using Paul's algorithm starting with val instead of 1, the first infinitely 
> deferred (never filled) hole is

val hole
1 5
2 7
3 11
4 15
5 19
6 23

so apparently 4*val-1 except for 1.

The series always fills downwards to 1 first.





_______________________________________________

Seqfan 
> Mailing list - 
> >http://list.seqfan.eu/