Padovan sequence
id:
padovan-sequence-209-2557661
title:
Padovan sequence
text:
In number theory, the Padovan sequence is the sequence of integers P(n) defined by the initial values
- P ( 0 ) = P ( 1 ) = P ( 2 ) = 1, and the recurrence relation
- P ( n ) = P ( n − 2 ) + P ( n − 3 ). The first few values of P(n) are
- 1, 1, 1, 2, 2, 3, 4, 5, 7, 9, 12, 16, 21, 28, 37, 49, 65, 86, 114, 151, 200, 265,... (sequence A000931 in the OEIS) A Padovan prime is a Padovan number that is prime. The first Padovan primes are:
- 2, 3, 5, 7, 37, 151, 3329, 23833, 13091204281, 3093215
brand slug:
wiki
category slug:
encyclopedia
description:
Sequence of integers
original url:
https://en.wikipedia.org/wiki/Padovan_sequence
date created:
2005-07-03T13:27:36Z
date modified:
2024-09-11T14:46:10Z
main entity:
{"identifier":"Q2706626","url":"https://www.wikidata.org/entity/Q2706626"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/4/4d/Padovan_triangles_%281%29.svg","width":572,"height":476}
fields total:
13
integrity:
16