28890

Appears in sequences

• a(n) = round(n*phi^18), where phi is the golden ratio, A001622.at n=5A004953
• a(n) = ceiling(n*phi^18), where phi is the golden ratio, A001622.at n=5A004973
• a(n) = prime(n)*prime(n-1) - 1.at n=39A023515
• Numbers k such that 171*2^k-1 is prime.at n=35A050837
• Number of bracelet structures using exactly three different colored beads.at n=13A056358
• Start with a(1)=1; for n >= 1, a(n+1)=a(n)+a(k) with k=[n - n-th digit of sqrt(2)]. If k<0 or k=0, then a(k)=0.at n=37A133393
• a(n) = 100*n^2 - 10.at n=16A158490
• Number of -n..n arrays x(0..6) of 7 elements with zero sum and no two consecutive declines, no adjacent equal elements, and no element more than one greater than the previous (random base sawtooth pattern).at n=37A200185
• Number of nX3 0..2 arrays with no average of any element and its horizontal and vertical neighbors equal to one.at n=3A200574
• Number of nX4 0..2 arrays with no average of any element and its horizontal and vertical neighbors equal to one.at n=2A200575
• T(n,k)=Number of nXk 0..2 arrays with no average of any element and its horizontal and vertical neighbors equal to one.at n=17A200579
• T(n,k)=Number of nXk 0..2 arrays with no average of any element and its horizontal and vertical neighbors equal to one.at n=18A200579
• Number of 9-line partitions of n (i.e., planar partitions of n with at most 9 lines).at n=18A225199
• a(n) = 5*Lucas(n).at n=18A280154