cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A062768 Multiples of 6 such that the sum of the digits is equal to 6.

This page as a plain text file.
%I A062768 #18 Sep 08 2020 03:32:31
%S A062768 6,24,42,60,114,132,150,204,222,240,312,330,402,420,510,600,1014,1032,
%T A062768 1050,1104,1122,1140,1212,1230,1302,1320,1410,1500,2004,2022,2040,
%U A062768 2112,2130,2202,2220,2310,2400,3012,3030,3102,3120,3210,3300,4002,4020,4110
%N A062768 Multiples of 6 such that the sum of the digits is equal to 6.
%C A062768 Even numbers with sum of digits equal to 6 are Harshad numbers (A005349). - _Davide Rotondo_, Sep 04 2020
%H A062768 Alois P. Heinz, <a href="/A062768/b062768.txt">Table of n, a(n) for n = 1..10000</a>
%e A062768 60 is a member of the sequence since 60 / 6 = 10 and 6 + 0 = 6; 114 is also an element since 114 is divisible by 6 and 1 + 1+ 4 = 6.
%t A062768 Select[ Range[ 6, 4200, 6 ], Plus @@ IntegerDigits[ # ] == 6 & ]
%o A062768 (ARIBAS): var stk: stack; end; minarg := 0; maxarg := 900; n := 6; for k := minarg to maxarg do m := k*n; s := itoa(m); for j := 0 to length(s) - 1 do stack_push(stk,atoi(s[j..j])); end; if sum(stack2array(stk)) = n then write(m," "); end; end;.
%Y A062768 Cf. A063416, A069521 to A069530, A069532, A069533, A069534, A069535, A069536, A069537, A052217, A063997, A069540.
%Y A062768 Subsequence of A005349.
%Y A062768 Row n=6 of A245062.
%K A062768 easy,nonn,base
%O A062768 1,1
%A A062768 Lisa O Coulter (lisa_coulter(AT)my-deja.com), Jul 17 2001
%E A062768 More terms from _Klaus Brockhaus_, Jul 20 2001