27307

Appears in sequences

• Strong pseudoprimes to base 95.at n=11A020321
• Odd 10-gonal (or decagonal) numbers.at n=41A028993
• a(n) = a(n-1) + 2*a(n-2), a(0)=2, a(1)=3.at n=14A048573
• Initial pile sizes that guarantee a win for player 2 in a variant of Fibonacci Nim where the players may not take one stone.at n=44A052492
• Numbers n such that A003313(3n) < A003313(n).at n=7A104699
• Numbers k such that A003313(k) = A003313(6*k).at n=7A116461
• a(n) = a(n-1) + 4*a(n-2) - 4*a(n-3) for n>3.at n=15A136336
• a(n) = 3*a(n-1) - 4*a(n-2) + 6*a(n-3) - 4*a(n-4), with initial terms 1,2,4,7.at n=15A136408
• a(n) = (5*4^n + 1)/3.at n=7A136412
• (L)-sieve transform of {1,4,7,10,...,3n-2,...} (A016777).at n=22A152009
• a(n) is the smallest positive multiple of 2n-1 that contains the binary representation of n in its binary representation and that is a palindrome when written in binary.at n=41A158789
• Locations of row maxima in "crushed" version of Stern's diatomic array.at n=27A169969
• a(n) = (10*2^n + 3 - (-1)^n)/6.at n=14A171231
• Dispersion of A004767 (4k+3, k>=0), by antidiagonals.at n=37A191669
• Triangular array read by rows. T(n,k) is the number of labeled bipartite graphs on n nodes having exactly k connected components; n>=1, 1<=k<=n.at n=22A228859
• a(n) = (1 + 2^n*(3 + 2*(-1)^n))/3.at n=14A255138
• 10-gonal (or decagonal) numbers with prime indices.at n=22A267217
• Squarefree terms of A276655.at n=30A276756
• Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 302", based on the 5-celled von Neumann neighborhood.at n=14A280839
• Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 302", based on the 5-celled von Neumann neighborhood.at n=14A280840