30343

Appears in sequences

• a(1) = 1, a(2) = 0; for n > 2, a(n) = n*Fibonacci(n-2) (with the convention Fibonacci(0)=0, Fibonacci(1)=1).at n=18A006490
• Fibonacci sequence beginning 0, 19.at n=17A022353
• Numbers n such that d(1)^1 + d(2)^2 + ... + d(p)^p and d(1)^p + d(2)^p-1 +... + d(p)^1 are squares, where d(i), i=1..p, are the digits of n.at n=49A178360
• Row sums of triangle A182701.at n=18A182705
• a(n) = n*Fibonacci(n-2) + ((-1)^n + 1)/2.at n=19A323812
• a(n) is the row of the Trithoff (tribonacci) array that contains the tails of the sequence which is n times the tribonacci numbers.at n=38A351685
• a(1) = 1, a(2) = 2; for n >= 3, a(n) = (n-1)^3 - a(n-1) - a(n-2).at n=44A361134