home
-
all
|
technology
-
piracy
-
linux
-
memes
-
asklemmy
-
selfhosted
-
world
-
technology
-
nostupidquestions
-
mildlyinfuriating
-
technology
-
youshouldknow
-
programmerhumor
-
worldnews
-
games
-
privacy
-
opensource
-
gaming
-
showerthoughts
-
lemmyworld
-
more ยป
log in
or
sign up
|
settings
[email protected]
overview
F(nachos) = F(nachos-1) + F(nachos-2) [
[email protected]
]
by
HolgerTDittmann
in
c/
[email protected]
[-]
[email protected]
1 points
7 months ago
* (last edited
7 months ago
)
Nice party game, who can eat the highest Fibonacho number of nachos.
permalink
fedilink
source
HolgerTDittmann
joined 1 year ago
Nice party game, who can eat the highest Fibonacho number of nachos.