Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136801
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A136801 Largest prime factor within successive composite runs >2. +0
5
5, 7, 11, 13, 17, 19, 23, 17, 29, 31, 23, 37, 41, 43, 47, 11, 53, 37, 61, 43, 67, 73, 31, 79, 83, 43, 89, 61, 97, 103, 109, 113, 29, 79, 83, 127, 131, 89, 137, 139, 97, 151, 103, 157, 163, 167, 173, 13, 179, 181, 53, 47, 191, 193, 197, 199, 101, 139, 211, 109, 17, 223 (list; graph; listen)
OFFSET

1,1

FORMULA

Compute successive composite runs >2.

EXAMPLE

a(1)=5 because the composite run from 8,9,10 contains prime factors, 2,3,5, with 5 being the largest at N=10.

CROSSREFS

Cf. A136798 A136799 A136800 A136802.

Adjacent sequences: A136798 A136799 A136800 this_sequence A136802 A136803 A136804

Sequence in context: A113909 A111906 A101550 this_sequence A106571 A067291 A007310

KEYWORD

easy,nonn,uned

AUTHOR

Enoch Haga (Enokh(AT)comcast.net), Jan 24 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 January 7 17:35 EST 2009. Contains 152824 sequences.


AT&T Labs Research