Sequences

a(n) = floor( tan(Fibonacci(n)) ).

[ sin(Fibonacci(n)) ].

[ cos(Fibonacci(n)) ].

Primes with digits in nondecreasing order.

Primes that when squared gives numbers with digits in nondecreasing order.

Squares of primes having digits in nondecreasing order.

Primes with digits in nonincreasing order.

Primes that when squared give numbers with digits in nonascending order.

Squares of primes with digits in nonascending order.

Numbers k such that k^2 - 2 is prime.

Primes of the form k^2 - 2.

a(n) = n^2 - 3.

Numbers k such that k^2 - 3 is prime.

Primes of form k^2 - 3.

a(n) = n^2 - 5.

Numbers k such that k^2 - 5 is prime.

Primes of form k^2 - 5.

a(n) = (n+3)^2 - 6.

Numbers k such that k^2 - 6 is prime.

Primes of the form n^2 - 6.

a(n) = n^2 - 7.

Numbers k such that k^2 - 7 is prime.

Primes of the form k^2 - 7.

a(n) = (n + 3)^2 - 8.

Numbers k such that k^2 - 8 is prime.

Primes of the form k^2 - 8.

Theta series of 4-dimensional 5-modular lattice with det 25 and minimal norm 2.

Smaller of two successive primes with a palindromic product.

Numbers whose iterated product of digits is a power of 2.

Product of digits of n is a nonzero Fibonacci number.

Iterated product of digits of n is a positive Fibonacci number.

a(n) = Fibonacci(n) - 2^(floor(n/2)).

Duplicate of A029561.

a(n) = either 4a(n-1)+1 or 4a(n-1)+3 depending on corresponding term of A005614, +1 for 0, +3 for 1.

5 times triangular numbers: a(n) = 5*n*(n+1)/2.

6 times triangular numbers: a(n) = 3*n*(n+1).

If n = Sum c_i 10^i then a(n) = Sum c_i 2^i.

Map n = Sum c_i 10^i to a(n) = Sum c_i 3^i.

Map n = Sum c_i 10^i to a(n) = Sum c_i 4^i.

Map n = Sum c_i 10^i to a(n) = Sum c_i 5^i.

Map n = Sum c_i*10^i to a(n) = Sum c_i*6^i.

Map n = Sum c_i 10^i to a(n) = Sum c_i 7^i.

Map n = Sum c_i 10^i to a(n) = Sum c_i 8^i.

Map n = Sum c_i 10^i to a(n) = Sum c_i 9^i.

Arrange digits of primes in ascending order.

Arrange digits of primes in descending order.

Arrange digits of squares in ascending order.

Arrange digits of squares in descending order.

Arrange digits of 2^n in ascending order.

Arrange digits of 2^n in descending order.