Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093148
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093148 Gcd(Fibonacci(n+5), Fibonacci(n+1)). +0
2
1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 3, 1 (list; graph; listen)
OFFSET

0,4

FORMULA

G.f. (1+x+x^2+3x^3)/(1-x^4); a(n)=3/2-sin(pi*n/2)-cos(pi*n)/2.

CROSSREFS

Cf. A000045, A061347.

Sequence in context: A007362 A060268 A030328 this_sequence A069292 A091842 A060901

Adjacent sequences: A093145 A093146 A093147 this_sequence A093149 A093150 A093151

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Apr 02 2004

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research