Golf a Custom Fibonacci Sequence

Question

The Fibonacci sequence is a fairly well known thing around here. Heck, it even has its own tag. However, for all that, we sure like to stick to our roots of 1, 1, ... (or is it 0, 1, ...? We may never know...). In this challenge, the rules are the same, but instead of getting the nth item in the Fibonacci sequence, you will get the nth item in the Fibonacci-esque sequence starting with x, y, ....

Input

Three integers, in whatever order you want. n is the index (0 or 1 indexed) of term in the sequence for your output. x and y are the first two items in your current program run's Fibonacci sequence.

Output

The nth term in the Fibonacci sequence starting with x, y.

Test Cases

(0-indexed)

n   x     y     out
5   0     0     0
6   0     1     8
6   1     1     13
2   5     5     10
10  2     2     178
3   3     10    23
13  2308  4261  1325165
0   0     1     0
1   0     1     1

(1-indexed)

n   x     y     out
6   0     0     0
7   0     1     8
7   1     1     13
3   5     5     10
11  2     2     178
4   3     10    23
14  2308  4261  1325165
1   0     1     0
2   0     1     1

Caveats

Assume 0 <= x <= y.

Please note your input order (must be constant).

@BusinessCat you mean like [1, 2, 3]? Yes. Whatever you need to accept 3 integers. — Stephen, May 17 '17 at 14:42
@StephenS How about taking an input as n,[x,y] where n is a number and x and y are numbers in a list? That's probably being a little too flexible though ;) — Tom, May 17 '17 at 14:54

Dennis · Accepted Answer · 2017-05-17 14:46:03Z

Jelly, 3 bytes

+¡ạ

Takes x, y, and n (0-indexed) as separate command-line arguments, in that order.

Try it online!

How it works

+¡ạ  Main link. Left argument: x. Right argument: y. Third argument: n

  ạ  Yield abs(x - y) = y - x, the (-1)-th value of the Lucas sequence.
+¡   Add the quicklink's left and right argument (initially x and y-x), replacing
     the right argument with the left one and the left argument with the result.
     Do this n times and return the final value of the left argument.

FrodCube · Accepted Answer · 2017-05-17 15:03:33Z

11

CJam, 14 9 bytes

l~{_@+}*;

Try it online!

Input format is "x y n". I'm still a noob at this, so I'm 100% sure there are better ways to do this, but please instead of telling me "do this" try to only give me hints so that I can find the answer myself and get better. Thanks!

edited May 17 '17 at 15:03

answered May 17 '17 at 14:48

FrodCube

5391 gold badge3 silver badges8 bronze badges

1

\$\begingroup\$ ririri can be shortened to 2 bytes. fI can be shortened to 1 byte. \$\endgroup\$ – Dennis May 17 '17 at 14:54
6

\$\begingroup\$ Welcome to PPCG! \$\endgroup\$ – Martin Ender May 17 '17 at 14:54
\$\begingroup\$ @Dennis improved! Thank you! And thanks for the welcome. \$\endgroup\$ – FrodCube May 17 '17 at 15:04

add a comment |

ovs · Accepted Answer · 2017-05-17 18:32:49Z

9

Python 2, 37 bytes

f=lambda x,y,n:n and f(y,x+y,n-1)or x

Try it online!

0-indexed, you may need to adjust the recursion limit for n≥999

edited May 17 '17 at 18:32

answered May 17 '17 at 14:08

ovs

32.1k2 gold badges20 silver badges92 bronze badges

add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

JavaScript (ES6), 27 26 bytes

Nothing fancy here, just a standard JS Fibonacci function with the initial values of 0 & 1 removed.

n=>g=(x,y)=>n--?g(y,x+y):x

Try it

f=
n=>g=(x,y)=>n--?g(y,x+y):x
o.value=f(i.value=13)(j.value=2308,k.value=4261)
oninput=_=>o.value=f(+i.value)(+j.value,+k.value)

*{font-family:sans-serif;}
input{margin:0 5px 0 0;width:50px;}
#o{width:75px;}

<label for=i>n: </label><input id=i type=number><label for=j>x: </label><input id=j type=number><label for=k>y: </label><input id=k type=number><label for=o>= </label><input id=o>

Dead Possum · Accepted Answer · 2017-05-17 14:05:55Z

6

Python 2, 40 bytes

0-indexed
Try it online

n,a,b=input()
exec'a,b=b,a+b;'*n
print a

answered May 17 '17 at 14:05

Dead Possum

3,2969 silver badges24 bronze badges

\$\begingroup\$ Haha not subject to a recursion/stack limit unlike some other answers. Nice trick. \$\endgroup\$ – ShreevatsaR May 19 '17 at 4:16
\$\begingroup\$ @ShreevatsaR Thanks! But recursive lambda beats me anyway :D \$\endgroup\$ – Dead Possum May 19 '17 at 8:17

add a comment |

Laikoni · Accepted Answer · 2017-05-17 21:33:33Z

5

Haskell, 30 bytes

x#y=(f!!)where f=x:scanl(+)y f

Try it online! 0-indexed. Use as (x#y)n, e.g. (0#1)5 for the fifth element of the original sequence.

The most likely shortest way to get the Fibonacci sequence in Haskell is f=0:scanl(+)1f, which defines an infinite list f=[0,1,1,2,3,5,8,...] containing the sequence. Replacing 0 and 1 with arguments x and y yields the custom sequence. (f!!) is then a function returning the nth element of f.

edited May 17 '17 at 21:33

answered May 17 '17 at 17:00

Laikoni

24.2k4 gold badges44 silver badges107 bronze badges

add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

5

Mathematica, 36 bytes

LinearRecurrence[{1,1},{##2},{#+1}]&

input

[n,x,y]

edited Jun 17 '20 at 9:04

Community♦

1

answered May 17 '17 at 23:38

J42161217

20.3k2 gold badges22 silver badges70 bronze badges

1

\$\begingroup\$ You can use ##2 instead of #2,#3. \$\endgroup\$ – alephalpha May 18 '17 at 8:45
\$\begingroup\$ very nice! fixed! \$\endgroup\$ – J42161217 May 18 '17 at 8:58

add a comment |

Nik Weiss · Accepted Answer · 2018-03-12 14:21:53Z

5

PowerShell, 40 bytes

$n,$x,$y=$args;2..$n|%{$y=$x+($x=$y)};$y

Try it online!

edited Mar 12 '18 at 14:21

answered Mar 12 '18 at 12:24

Nik Weiss

911 silver badge5 bronze badges

add a comment |

Riley · Accepted Answer · 2017-05-17 14:05:15Z

Brain-Flak, 38 bytes

{({}[()]<(({}<>)<>{}<(<>{}<>)>)>)}{}{}

Try it online!

{({}[()]<                      >)}     # For n .. 0
         (({}<>)<>            )        # Copy TOS to the other stack and add it to...
                  {}                   # The second value
                    <(<>{}<>)>         # Copy what was TOS back
                                  {}{} # Pop the counter and the n+1th result

Community · Accepted Answer · 2020-06-17 09:04:33Z

4

Ruby, 27 bytes

->a,b,n{n.times{b=a+a=b};a}

edited Jun 17 '20 at 9:04

Community♦

1

answered May 19 '17 at 9:55

G B

11.9k1 gold badge15 silver badges39 bronze badges

add a comment |

fireflame241 · Accepted Answer · 2017-05-17 14:12:29Z

3

Jelly, 6 bytes

;SḊµ¡I

Try it online!

Explanation

   µ¡  - repeat n times (computes the n+1th and n+2th element):
 S     -  take the sum of the elements of the previous iteration (starting at (x,y))
;      -  append to the end of the previous iteration
  Ḋ    -  remove the first element
     I - Take the difference of the n+1th and n+2th to get the n-th.

edited May 17 '17 at 14:12

answered May 17 '17 at 14:06

fireflame241

13.2k2 gold badges19 silver badges67 bronze badges

add a comment |

Tom · Accepted Answer · 2017-05-17 15:02:46Z

3

TAESGL, 4 bytes

ēB)Ė

1-indexed

Interpreter

Explanation

Input taken as n,[x,y]

 ēB)Ė
AēB)     get implicit input "A" Fibonacci numbers where "B" is [x,y]
    Ė    pop the last item in the array

edited May 17 '17 at 15:02

answered May 17 '17 at 13:53

Tom

3,0885 silver badges19 bronze badges

add a comment |

eush77 · Accepted Answer · 2017-05-17 22:50:37Z

3

Prolog (SWI), 77 bytes

f(N,Y,Z):-M is N-1,f(M,X,Y),Z is X+Y.
l(N,A,B,X):-asserta(f(0,A,B)),f(N,X,_).

Try it online!

Started off golfing Leaky Nun's answer and arrived at something completely different.

This one has a rule for (Nᵗʰ, (N+1)ᵗʰ) in terms of ((N-1)ᵗʰ, Nᵗʰ) and uses database management to assert 0ᵗʰ and 1ˢᵗ elements at runtime.

f(N,X,Y) means Nᵗʰ element is X and (N+1)ᵗʰ element is Y.

edited May 17 '17 at 22:50

answered May 17 '17 at 22:44

eush77

1,3004 silver badges10 bronze badges

add a comment |

alephalpha · Accepted Answer · 2017-05-18 08:56:08Z

3

Octave, 24 bytes

@(n,x)(x*[0,1;1,1]^n)(1)

Input format: n,[x,y].

Try it online!

answered May 18 '17 at 8:56

alephalpha

24.4k4 gold badges34 silver badges88 bronze badges

add a comment |

Leaky Nun · Accepted Answer · 2018-04-21 22:30:20Z

3

Prolog (SWI), 85 bytes

l(0,X,Y,X).
l(1,X,Y,Y).
l(N,X,Y,C):-M is N-1,P is N-2,l(M,X,Y,A),l(P,X,Y,B),C is A+B.

Try it online!

0-indexed.

edited Apr 21 '18 at 22:30

answered May 17 '17 at 14:21

Leaky Nun

46.1k5 gold badges94 silver badges268 bronze badges

\$\begingroup\$ Could you edit this answer? I seem to have accidentally downvoted it the day you posted it. \$\endgroup\$ – Esolanging Fruit Apr 21 '18 at 22:29
1

\$\begingroup\$ @EsolangingFruit done \$\endgroup\$ – Leaky Nun Apr 21 '18 at 22:30

add a comment |

Skidsdev · Accepted Answer · 2017-05-17 14:04:37Z

2

Braingolf, 15 bytes

VR<2-M[R!+v]R_;

_; is no longer needed on the latest version of Braingolf, however that's as of ~5 minutes ago, so would be non-competing.

answered May 17 '17 at 14:04

Skidsdev

9,9991 gold badge36 silver badges82 bronze badges

add a comment |

totallyhuman · Accepted Answer · 2017-05-17 14:11:50Z

2

Python 2, 112 bytes

1-indexed.

import itertools
def f(x,y):
 while 1:yield x;x,y=y,x+y
def g(x,y,n):return next(itertools.islice(f(x,y),n-1,n))

Try it online!

answered May 17 '17 at 14:11

totallyhuman

15.7k1 gold badge26 silver badges73 bronze badges

\$\begingroup\$ Erp, too late and too big. \$\endgroup\$ – totallyhuman May 17 '17 at 14:12

add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

MATL, 7 bytes

:"wy+]x

Output is 0-based.

Try it at MATL Online!

Explanation

Let the inputs be denoted n (index), a, b (initial terms).

:"     % Implicitly input n. Do this n times
       %   At this point in each iteration, the stack contains the two most
       %   recently computed terms of the sequence, say s, t. In the first
       %   iteration the stack is empty, but a, b will be implicitly input
       %   by the next statement
  w    %   Swap. The stack contains t, s
  y    %   Duplicate from below. The stack contains t, s, t
  +    %   Add. The stack contains t, s+t. These are now the new two most
       %   recently comnputed terms
]      % End
x      % Delete (we have computed one term too many). Implicitly display

JAD · Accepted Answer · 2017-05-18 07:13:22Z

R, 39 bytes

f=function(x,y,n)'if'(n,f(y,x+y,n-1),x)

A simple recursive function. Funnily enough this is shorter than anything I can come up with for the regular Fibonacci sequence (without built-ins), because this doesn't have to assign 1 to both x and y =P

Calculates n+1 numbers of the sequence, including the initial values. Each recursion is calculates with n-1 and stopped when n==0. The lowest of the two numbers is then returned, giving back the n-th value.

R. Kap · Accepted Answer · 2017-05-18 10:20:58Z

2

dc, 36 bytes

?sdsbsa[lddlb+sdsbla1-dsa1<c]dscxldp

Try it online!

0-indexed. Input must be in the format n x y.

answered May 18 '17 at 10:20

R. Kap

4,8182 gold badges10 silver badges33 bronze badges

add a comment |

Jörg Hülsermann · Accepted Answer · 2017-05-19 12:15:08Z

2

PHP>=7.1, 55 Bytes

for([,$n,$x,$y]=$argv;$n--;$x=$y,$y=$t)$t=$x+$y;echo$x;

Online Version

PHP>=7.1, 73 Bytes

for([,$n,$x,$y]=$argv,$r=[$x,$y];$i<$n;)$r[]=$r[+$i]+$r[++$i];echo$r[$n];

Online Version

edited May 19 '17 at 12:15

answered May 17 '17 at 14:34

Jörg Hülsermann

13.2k2 gold badges9 silver badges29 bronze badges

1

\$\begingroup\$ Taking advantage of strange PHP's evaluation order: $y=+$x+$x=$y. Also, you can use just $n-- instead of $i++<$n. \$\endgroup\$ – user63956 May 19 '17 at 11:56

add a comment |

Bolce Bussiere · Accepted Answer · 2018-01-09 19:46:20Z

Common Lisp, 49 Bytes, 0-indexed

(defun fib(n x y)(if(= 0 n)x(fib(1- n)y(+ x y))))

I'm a Lisp noob so any tips would be appreciated ;)

Explanation:

(defun fib(n x y)                                  | Define a function taking 3 arguments
                 (if(= 0 n)x                       | If n = 0, return x
                            (fib(1- n)y(+ x y))))  | Otherwise, call fib with n-1, y, and x+y

Khuldraeseth na'Barya · Accepted Answer · 2018-04-22 00:01:57Z

2

br**nfuck, 39 29 bytes

Thanks to @JoKing for -10!

,<,<,[>[>+>+<<-]<[>+<-]>-]>>.

TIO won't work particularly well for this (or for any BF solution to a problem involving numbers). I strongly suggest @Timwi's EsotericIDE (or implementing BF yourself).

Takes x, then y, then n. 0-indexed. Assumes an unbounded or wrapping tape.

Explanation

,<,<,            Take inputs. Tape: [n, y, x]
[                While n:
  > [->+>+<<]      Add y to x, copying it to the next cell along as well. Tape: [n, 0, x+y, y]
  < [>+<-]         Move n over. Tape: [0, n, x+y, y]
  >-               Decrement n.
] >>.            End loop. Print cell 2 to the right (x for n == 0).

edited Apr 22 '18 at 0:01

answered Apr 21 '18 at 22:46

Khuldraeseth na'Barya

2,88813 silver badges34 bronze badges

\$\begingroup\$ Why do you bother moving x and y when you can just move n? Try It Online \$\endgroup\$ – Jo King♦ Apr 21 '18 at 23:07
\$\begingroup\$ @JoKing Considered that (but longer on my own), but it doesn't quite work, unless OP allows "-1-indexing". \$\endgroup\$ – Khuldraeseth na'Barya Apr 21 '18 at 23:35
\$\begingroup\$ Oh, just add a > to the end or swap x and y order \$\endgroup\$ – Jo King♦ Apr 21 '18 at 23:48
\$\begingroup\$ @JoKing My palm hit my face quite hard just now. Thanks! \$\endgroup\$ – Khuldraeseth na'Barya Apr 21 '18 at 23:53
\$\begingroup\$ Why did you bother to censor "brain" but not the second word in the programming language's name? \$\endgroup\$ – MilkyWay90 Mar 12 '19 at 16:51

add a comment |

PikalaxALT · Accepted Answer · 2018-04-22 00:11:58Z

2

C (gcc), 29 bytes

f(n,x,y){n=n?f(n-1,y,x+y):x;}

Try it online!

This implementation is 0-based.

answered Apr 22 '18 at 0:11

PikalaxALT

1411 bronze badge

1

\$\begingroup\$ Nice, and welcome! Here's a prettier TIO setup for testing, should you choose to use it. \$\endgroup\$ – Khuldraeseth na'Barya Apr 22 '18 at 0:19

add a comment |

Emigna · Accepted Answer · 2017-05-17 14:18:33Z

1

05AB1E, 9 bytes

`©GDŠ+}®@

Try it online!

Explanation

`           # split inputs as separate to stack
 ©          # store n in register
  G         # n-1 times do
   D        # duplicate top of stack
    Š       # move down 2 places on stack
     +      # add top 2 values of stack
      }     # end loop
       ®@   # get the value nth value from the bottom of stack

edited May 17 '17 at 14:18

answered May 17 '17 at 13:55

Emigna

51.2k5 gold badges39 silver badges157 bronze badges

add a comment |

Felipe Nardi Batista · Accepted Answer · 2017-05-17 21:01:03Z

1

Lua, 44 bytes

0-Indexed

n,x,y=...for i=1,n do
x,y=y,x+y
end
print(x)

Try it online!

answered May 17 '17 at 21:01

Felipe Nardi Batista

2,3651 gold badge10 silver badges30 bronze badges

add a comment |

Wheat Wizard · Accepted Answer · 2017-05-17 21:11:52Z

1

Klein, 18 + 3 bytes

This uses the 000 topology

:?\(:(+)$)1-+
((/@

Pass input in the form x y n.

edited May 17 '17 at 21:11

answered May 17 '17 at 21:06

Wheat Wizard♦

62.7k13 gold badges203 silver badges439 bronze badges

add a comment |

score 1 · Accepted Answer · 2017-05-17 22:25:29Z

Axiom, 88 57 bytes

f(k,x,y)==(repeat(k<=0=>break;c:=y;y:=x+y;x:=c;k:=k-1);x)

this would pass the test proposed (0 indexed)

(14) -> f(5,0,0)
   (14)  0
                                                 Type: NonNegativeInteger
(15) -> f(6,0,1)
   (15)  8
                                                    Type: PositiveInteger
(16) -> f(2,5,5)
   (16)  10
                                                    Type: PositiveInteger
(17) -> f(10,2,2)
   (17)  178
                                                    Type: PositiveInteger
(18) -> f(3,3,10)
   (18)  23
                                                    Type: PositiveInteger
(19) -> f(13,2308,4261)
   (19)  1325165
                                                    Type: PositiveInteger

eush77 · Accepted Answer · 2017-05-17 23:21:50Z

1

Retina, 37 bytes

\d+
$*1
+`(1*) (1*) 1
$2 $1$2 
 .*

1

Try it online!

0-based, takes x y n separated by space. Calculates in unary.

answered May 17 '17 at 23:21

eush77

1,3004 silver badges10 bronze badges

add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

1

TI-Basic, 32 bytes

Prompt N,X,Y
While N
X+Y➡Z
Y➡X
Z➡Y
DS<(N,0
End
X

edited Jun 17 '20 at 9:04

Community♦

1

answered May 18 '17 at 0:23

pizzapants184

3,37410 silver badges16 bronze badges

add a comment |

Golf a Custom Fibonacci Sequence

Input

Output

Test Cases

Caveats

48 Answers 48

Jelly, 3 bytes

How it works

CJam, 14 9 bytes

Python 2, 37 bytes

JavaScript (ES6), 27 26 bytes

Try it

Python 2, 40 bytes

Haskell, 30 bytes

Mathematica, 36 bytes

PowerShell, 40 bytes

Brain-Flak, 38 bytes

Ruby, 27 bytes

Jelly, 6 bytes

TAESGL, 4 bytes

Prolog (SWI), 77 bytes

Octave, 24 bytes

Prolog (SWI), 85 bytes

Braingolf, 15 bytes

Python 2, 112 bytes

MATL, 7 bytes

Explanation

R, 39 bytes

dc, 36 bytes

PHP>=7.1, 55 Bytes

PHP>=7.1, 73 Bytes

Common Lisp, 49 Bytes, 0-indexed

Explanation:

br**nfuck, 39 29 bytes

Explanation

C (gcc), 29 bytes

05AB1E, 9 bytes

Lua, 44 bytes

Klein, 18 + 3 bytes

Axiom, 88 57 bytes

Retina, 37 bytes

TI-Basic, 32 bytes

Your Answer

Sign up or log in

Post as a guest

Not the answer you're looking for? Browse other questions tagged code-golf number sequence fibonacci or ask your own question.

Linked

Related

Hot Network Questions