Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A102642
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A102642 a(n)=A102640(n)+A102641(n)-1. +0
5
2, 3, 5, 5, 4, 5, 3, 4, 4, 5, 3, 7, 3, 6, 3, 3, 4, 6, 3, 6, 4, 7, 3, 6, 3, 5, 3, 5, 4, 7, 3, 5, 4, 5, 5, 7, 3, 6, 5, 5, 3, 6, 3, 6, 5, 5, 3, 7, 3, 5, 4, 5, 3, 6, 7, 3, 6, 3, 3, 4, 3, 5, 4, 3, 4, 6, 3, 5, 5, 6, 3, 7, 3, 5, 7, 5, 5, 6, 3, 5, 6, 5, 3, 4, 3, 5, 3, 6, 3, 5, 3, 5, 4, 5, 5, 5, 4, 6, 4, 7, 3, 6, 3, 4, 7 (list; graph; listen)
OFFSET

1,1

COMMENT

A006530(2^n)=2 is a local minimum. Actual sequence displays the "width of valley" between the two nearest peaks of largest prime divisors. At the bottom of valley lays the number 2, the minimum.

EXAMPLE

n=12: 2^10=4096. The greatest prime divisors of numbers around 4096 [both downward and upward] are as follows: {31, 4093, 89, 13, 2, 241, 683, 4099, 41}. The length of relevant sequence, i.e. between peaks 4093 and 4099 is 7, thus a(12)=7.

CROSSREFS

Cf. A006530, A102640, A102641, A102643, A102644.

Adjacent sequences: A102639 A102640 A102641 this_sequence A102643 A102644 A102645

Sequence in context: A133293 A096289 A131295 this_sequence A133304 A003660 A111164

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Jan 21 2005

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 May 16 01:24 EDT 2008. Contains 139630 sequences.


AT&T Labs Research