CodeCogs

Calculates the Padovan numbers of orders 0 through \e n.

Interface

#include <codecogs/maths/combinatorics/sequences/padovan_numbers_list.h>

using namespace Maths::Combinatorics::Sequences;

std::vector<int> padovan_numbers_list(int n)

This function generates an array of Padovan numbers of orders 0 through n. The Padovan sequence is defined by the following recurrent formula:

$P(i+1) = P(i-1) + P(i-2)$

(1)

with initial values

$P(0) = P(1) = P(2) = 1$

(2)

Example 1

#include <codecogs/maths/combinatorics/sequences/padovan_numbers_list.h>
#include <iostream>
int main() {
  std::vector<int> result = Maths::Combinatorics::Sequences::padovan_numbers_list(11);
  std::cout << "Number of values: " << result.size() << std::endl;
  for (int i = 0; i < result.size(); i++)
    std::cout << result[i] << "  ";
  std::cout << std::endl;
  return 0;
}

Output:

Number of values: 11
1  1  1  2  2  3  4  5  7  9  12

Returns

the Padovan numbers of order 0 through n

References

SUBSET, a C++ library of combinatorial routines, http://www.csit.fsu.edu/~burkardt/cpp\_src/subset/subset.html

Padovan_Numbers_List

Interface

Example 1

Returns

References