36949

Appears in sequences

• a(n) is the solution to the postage stamp problem with 5 denominations and n stamps.at n=25A001210
• First terms from generation 1 onwards.at n=14A048456
• Odd numbers in sorted order from generation 2 onwards.at n=40A048462
• Number of partitions of n into parts having at most two prime-factors.at n=42A101049
• 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, 1), (-1, 1, -1), (0, 0, 1), (1, -1, 0), (1, 0, -1)}.at n=12A148021
• Number of ways that a 1 X n rectangular tile T, marked into n unit squares, can be surrounded by one layer of copies of itself laid in the plane grid generated by the units of T. Ways that differ by rotation or reflection are not counted as different. The surrounded tile is the exact surrounded region.at n=20A159294
• Base-11 Armstrong or narcissistic numbers (written in base 10).at n=23A161948
• Records in A098550.at n=51A248647
• Expansion of Product_{k>=1} (1 - x^(10*k))/(1 - x^k).at n=41A261776
• Starting at n, a(n) is the number of times we travel to a position already visited according to the following rules. On the k-th step (k=1,2,3,...) move a distance of k in the direction of zero. If the number landed on has been landed on before, move a distance of k away.at n=60A324674
• Records in A352187.at n=57A352191
• Number of permutations of {1..n} with all distinct lengths of maximal runs (increasing by 1).at n=19A384891