AdvancedAdvanced PostgreSQL

Recursive fibonacci using CTE

The query

SQL

WITH RECURSIVE fib AS (
  SELECT 0 AS a, 1 AS b
  UNION ALL
  SELECT b, a + b FROM fib WHERE b < 1000
)
SELECT a AS fibonacci_number FROM fib
ORDER BY a;

Tested against PostgreSQL 16

Note

“Recursive CTE for mathematical sequences. Demonstrates that SQL is Turing-complete.