Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A135959
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A135959 a(n) = smallest Fibonacci number with prime index which has exactly n prime factors. +0
6
1, 2, 4181, 24157817, 83621143489848422977, 322615043836854783580186309282650000354271239929 (list; graph; listen)
OFFSET

0,2

COMMENT

a(6) has 105 digits.

a(7) = 22334640661774067356412331900038009953045351020683823507202893507476314037053.

Variant of A114722. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 28 2008]

FORMULA

a(n) = Fibonacci(A135958(n)).

CROSSREFS

Cf. A000045, A050937, A075737, A134852, A135953-A135956, A135958.

Sequence in context: A114573 A024035 A048831 this_sequence A114722 A105667 A067668

Adjacent sequences: A135956 A135957 A135958 this_sequence A135960 A135961 A135962

KEYWORD

nonn

AUTHOR

Artur Jasinski (grafix(AT)csl.pl), Dec 08 2007

EXTENSIONS

Edited by David Wasserman (dwasserm(AT)earthlink.net), Mar 26 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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research