Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A123678
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A123678 Numbers n such that Lucas[Prime[Prime[n]]] is prime, where Lucas[k] = A000032[k]. +0
3
2, 3, 4, 5, 6, 20, 30, 117, 136, 1616 (list; graph; listen)
OFFSET

1,1

COMMENT

Indices of prime Lucas numbers are listed in A001606[n] = {0,2,4,5,7,8,11,13,16,17,19,31,37,41,47,53,61,71,79,113,...}. Numbers n such that Lucas[Prime[n]] is prime are listed in A120561[n] = {1,3,4,5,6,7,8,11,12,13,15,16,18,20,22,30,65,71,96,112,113,...}. Primes in A120561[n] are listed in A123677[n] = Prime[a(n)] = {3,5,7,11,13,71,113,643,769,13681,...} Primes p such that Lucas[Prime[p]] is prime.

FORMULA

a(n) = PrimePi[ A123677[n] ].

CROSSREFS

Cf. A000032, A123677, A120561, A001606. Cf. A119984, A122534 - Numbers n such that Fibonacci[Prime[Prime[n]]] is prime.

Sequence in context: A048095 A031015 A024639 this_sequence A037333 A037404 A037440

Adjacent sequences: A123675 A123676 A123677 this_sequence A123679 A123680 A123681

KEYWORD

hard,more,nonn

AUTHOR

Alexander Adamchuk (alex(AT)kolmogorov.com), Oct 05 2006

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 November 25 14:49 EST 2009. Contains 167514 sequences.


AT&T Labs Research