Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A014437
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A014437 Odd Fibonacci numbers. +0
3
1, 1, 3, 5, 13, 21, 55, 89, 233, 377, 987, 1597, 4181, 6765, 17711, 28657, 75025, 121393, 317811, 514229, 1346269, 2178309, 5702887, 9227465, 24157817, 39088169, 102334155, 165580141, 433494437, 701408733 (list; graph; listen)
OFFSET

0,3

FORMULA

Fibonacci(3n+1) union Fibonacci(3n+2).

a(n) = Fibonacci(3*floor((n+1)/2)) + (-1)^n) - Antti Karttunen, Feb 05, 2001

MATHEMATICA

a={}; Do[f=Fibonacci[n]; If[OddQ[f], AppendTo[a, f]], {n, 1, 30, 1}]; a (Vladimir Orlovsky, Jul 23 2008)

CROSSREFS

Cf. A001651, A059878.

Adjacent sequences: A014434 A014435 A014436 this_sequence A014438 A014439 A014440

Sequence in context: A059874 A059875 A086893 this_sequence A104222 A045414 A089067

KEYWORD

nonn,easy

AUTHOR

Mohammad K. Azarian (ma3(AT)evansville.edu)

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 October 9 14:06 EDT 2008. Contains 144831 sequences.


AT&T Labs Research