Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #6 Mar 30 2012 17:26:37
%S 5,6,16,23,33,35,51,55,63,91,103,121,138,178,195,216,233,243,268,348,
%T 385,436,510,511,518,588,628,675,693,696,710,723,741,751,773,810,818,
%U 863,913,930,973,975,1025,1035,1036,1045,1070,1071,1115,1161,1260,1273,1311,1336,1365,1368,1386,1438,1441,1448,1490,1501,1508,1521,1540,1546,1623,1651,1655,1720
%N a(n)=(A112998(n)-1)/12
%C All terms in A112998 are congruent to 1 modulo 12, hence this sequence.
%H Zak Seidov, <a href="/A186696/b186696.txt">Table of n, a(n) for n = 1..1500</a>
%Y Cf. A112998.
%K nonn
%O 1,1
%A _Zak Seidov_, Feb 25 2011