49215

Appears in sequences

• Numbers k such that phi(k) = phi(k+1).at n=28A001274
• Numbers whose base-4 representation contains exactly four 0's and four 3's.at n=0A045085
• Squarefree numbers k such that phi(k) = phi(k+1).at n=13A063739
• Number of partitions p of n for which Odd(p) = Odd(p') (mod 4), where p' is the conjugate of p.at n=44A097566
• 6th diagonal of triangle in A059317.at n=20A106150
• First differences of the binomial transform of the distinct partition numbers (A000009).at n=14A129519
• A number n is included in the sequence if and only if the n-th integer from among those positive integers which are coprime to n+1 = the (n+1)-st integer from among those positive integers which are coprime to n.at n=10A139766
• Number of n X n binary arrays symmetric about main diagonal with all ones connected only in a 1000-1000-1111-1000 pattern in any orientation.at n=12A147126
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, -1), (0, 0, 1), (1, -1, 1), (1, 0, 0)}.at n=10A149831
• Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 606", based on the 5-celled von Neumann neighborhood.at n=33A289891
• Number of self-avoiding paths with nodes chosen among n given points on a circle; one-node paths are allowed.at n=9A360715
• Tetraprimes (or products of exactly four distinct prime numbers) that are the sum of two successive tetraprimes.at n=22A380348
• Triangle read by rows: T(n,k) is the number of sets of noncrossing paths of size k whose nodes are a subset of n nodes arranged in a circle with one node paths allowed, 0 <= k <= n.at n=56A390897