login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A061083 Fibonacci-type sequence based on division: a(0) = 1, a(1) = 2 and a(n) = a(n-2)/a(n-1) but ignore decimal point. 2
1, 2, 5, 4, 125, 32, 390625, 8192, 476837158203125, 17179869184, 277555756156289135105907917022705078125, 618970019642690137449562112 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 0..17

FORMULA

a(n) = k^(n-th Fibonacci number) with k=2 if n is odd, k=5 if n is even

EXAMPLE

a(6) = 390625, since a(4)/a(5) = 125/32 = 3.90625

PROG

(Haskell)

a061083 n = a061083_list !! n

a061083_list = 1 : 2 : zipWith divIgnPnt a061083_list (tail a061083_list)

   where divIgnPnt x y = ddiv (10 * m) x' where

            ddiv u w | r == 0    = 10 * w + q

                     | otherwise = ddiv (10 * r) (10 * w + q)

                     where (q, r) = divMod u y

            (x', m) = divMod x y

-- Reinhard Zumkeller, Dec 29 2011

CROSSREFS

Cf. A061084 for subtraction, A000301 for multiplication and A000045 for addition - the common Fibonacci numbers

Sequence in context: A229789 A210419 A206484 * A177039 A075102 A209883

Adjacent sequences:  A061080 A061081 A061082 * A061084 A061085 A061086

KEYWORD

nonn,easy,nice,base

AUTHOR

Ulrich Schimke (ulrschimke(AT)aol.com)

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 16 00:50 EDT 2018. Contains 316252 sequences. (Running on oeis4.)