Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A062063
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A062063 a(1) = 1; a(n+1) = smallest number so that the 5 numbers a(n-3), a(n-2), a(n-1), a(n), a(n+1) are pairwise coprime. +0
3
1, 2, 3, 5, 7, 11, 13, 16, 17, 19, 21, 23, 25, 26, 29, 31, 33, 35, 37, 38, 41, 43, 45, 47, 49, 52, 53, 55, 57, 59, 61, 62, 65, 67, 69, 71, 73, 74, 77, 79, 81, 83, 85, 86, 89, 91, 93, 95, 97, 101, 103, 104, 105, 107, 109, 113, 116, 117, 119, 121, 125, 127, 128, 129 (list; graph; listen)
OFFSET

1,2

COMMENT

Is a(n+1) - a(n) bounded?

For n < 10^7, the maximum value of a(n+1) - a(n) is 12. - T. D. Noe, May 14 2007

LINKS

T. D. Noe, Table of n, a(n) for n=1..1000

CROSSREFS

Cf. A047255, A062062.

Adjacent sequences: A062060 A062061 A062062 this_sequence A062064 A062065 A062066

Sequence in context: A143578 A086070 A117093 this_sequence A026478 A084111 A020625

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jun 12 2001

EXTENSIONS

Corrected and extended by Dean Hickerson (dean(AT)math.ucdavis.edu), Jul 10, 2001

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 13 09:05 EDT 2008. Contains 145008 sequences.


AT&T Labs Research