Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A057862
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A057862 2^n modulo Fibonacci(n). +0
5
0, 0, 0, 1, 2, 0, 11, 4, 2, 34, 1, 64, 37, 173, 438, 394, 118, 1160, 1663, 1, 6466, 14508, 20764, 38368, 18257, 99928, 64234, 202972, 15836, 410224, 184593, 1520257, 538006, 2773540, 5886173, 9996832, 5132559, 9902536, 21703576, 33466456 (list; graph; listen)
OFFSET

1,5

FORMULA

a(n) = A000079(n) - A057861(n)*A000045(n)

CROSSREFS

Sequence in context: A019140 A086890 A138542 this_sequence A102869 A075533 A053814

Adjacent sequences: A057859 A057860 A057861 this_sequence A057863 A057864 A057865

KEYWORD

nonn

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Sep 08 2000

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 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research