2143648

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=27A005314
• Pisot sequences E(3,7), P(3,7).at n=16A010912
• a(0) = 0, a(1) = 1, a(2) = 1; thereafter a(n) = 5*a(n-1) - 4*a(n-2) + a(n-3).at n=14A012855
• Pisot sequences E(5,9), P(5,9).at n=23A020713
• Length of lists created by n substitutions k -> Range[0,1+Mod[k+1,3]] starting with {0}.at n=13A084084
• a(n+3) = 3*a(n+2) - 2*a(n+1) + a(n).at n=17A095263
• Padovan sequence for indices of the Beatty sequence of the tribonacci constant.at n=29A108168
• Padovan numbers for which the sum of the digits is also a Padovan number.at n=20A117597
• Padovan numbers for which the multiplicative digital root is also a Padovan number.at n=39A117600
• Padovan numbers which can be divided by their digital root.at n=35A117602
• Even Padovan numbers.at n=25A134720
• Expansion of 1/(1-x^2-x^3).at n=55A182097