Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A152735
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A152735 Count of links in n-th maximal chain of primes. +0
9
2, 3, 1, 1, 2, 4, 3, 1, 1, 2, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 1, 1, 2, 1, 2, 4, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 6, 1, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 2, 2, 2, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 2, 1 (list; graph; listen)
OFFSET

1,1

COMMENT

One less than count of members of n-th maximal chain of primes. For definitions see A152658.

LINKS

Klaus Brockhaus, Table of n, a(n) for n=1..1000

EXAMPLE

The consecutive primes 5, 7, 11 form the first maximal chain of primes (see example in A152658); it has three members, two links. Therefore a(1) = 2.

PROGRAM

(PARI) {n=1; while(n<560, c=0; while(isprime(n*prime(n)+(n+1)*prime(n+1)), c++; n++); if(c>0, print1(c, ", ")); n++)}

CROSSREFS

Cf. A152658 (beginnings of maximal chains of primes), A152657 (secluded primes), A119487 (primes of the form i*(i-th prime) + (i+1)*((i+1)-th prime), linking primes).

Sequence in context: A111879 A114732 A123338 this_sequence A046226 A054722 A067627

Adjacent sequences: A152732 A152733 A152734 this_sequence A152736 A152737 A152738

KEYWORD

nonn

AUTHOR

Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Dec 16 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 December 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research