Functional Walk Generator

A Walk is defined as a sequence of steps of connected graph vertices and graph edges.
Functional Walks are generated by using a given function f(n) and an additional function g(n):
Equation Input and Settings

f(n) = mod
g(n) = n <
Block Mode

Random Slideshow

Show Advanced Settings and MoreInformation on Walk Theory

▲ ▼

✕

Advanced Settings

Generation Speed:

Background Color:

Line/Block Color:

Line Width:

Block Size:

Vertex/Node Size:

Vertex/Node Color:

Build-In Functions

Basics

+, -, *, /

Basic arithmetic operations.

a^b, a**b

a to the power of b.

sin(n), cos(n)

Sine and cosine.

log(n)

Logarithm with base e.

a mod b, a % b

a modulo b.

Constants

PI, pi

Mathematical constant pi.

E, e

Mathematical constant e.

GAMMA, gamma

Mathematical constant Gamma.

Advanced Functions

ABS(n)

The absolut value of n.

CEIL(n)

Ceil function.

FACT(n)

n!, n factorial.

FIBO(n), F(n)

The n-th Fibonacci Number.

FLOOR(n)

Floor function.

OEIS: Axxxxxx

Use OEIS sequence.

PRIME(n), P(N)

The n-th prime number.

PRIMEDELTA(n), PD(n)

The difference of the n-th prime numbers.

SEQ: a,b,c,d,...

Use personal number squence.

SIGMA(n)

Devisor fum function.

TAU(n)

Devisor counting function.

Mathematics of Functional Walk Theory

A Walk is defined as a sequence of steps of connected graph vertices and graph edges.
Functional Walks are generated by using a main function f(n) and an additional step function g(n):This process can be summarized trough the recursion

Further Links: Wolfram: Walk, Wikipedia: IFS, Walk Pattern Gallery

Dark Theme ON/OFF

💡

💡