62608681

Appears in sequences

• For n = 0, 1, 2, a(n) = n; thereafter, a(n) = 2*a(n-1) - a(n-2) + a(n-3).at n=33A005314
• Pisot sequences E(3,7), P(3,7).at n=20A010912
• Take every 5th term of Padovan sequence A000931, beginning with the sixth term.at n=13A012772
• Take every 5th term of Padovan sequence A000931, beginning with the first term.at n=14A012864
• Pisot sequences E(5,9), P(5,9).at n=29A020713
• Length of lists created by n substitutions k -> Range[0,1+Mod[k+1,3]] starting with {0}.at n=16A084084
• a(n+3) = 3*a(n+2) - 2*a(n+1) + a(n).at n=21A095263
• Padovan numbers for which the sum of the digits is also a Padovan number.at n=22A117597
• Padovan numbers for which the product of the digits is also a Padovan number.at n=26A117599
• Padovan numbers which can be divided by their digital root.at n=40A117602
• Padovan numbers that are semiprimes.at n=17A122498
• Odd Padovan numbers.at n=40A134719