A047333 Duplicate of A032796.
1, 2, 3, 5, 6, 8, 9, 10, 12, 13, 15, 16, 17, 19, 20, 22, 23, 24, 26, 27, 29, 30, 31, 33, 34
Offset: 1
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.
Filtered([0..151],n->n mod 12 = 0 or n mod 12 = 2 or n mod 12 = 4 or n mod 12 = 7 or n mod 12 = 9); # Muniru A Asiru, Oct 24 2018
[Floor(12*(n-1)/5): n in [1..100]]; // G. C. Greubel, Oct 23 2018
seq(floor(12*(n-1)/5),n=1..65); # Muniru A Asiru, Oct 24 2018
fQ[n_] := MemberQ[{0, 2, 4, 7, 9}, Mod[n, 12]]; Select[ Range[0, 152], fQ] (* Robert G. Wilson v, Oct 09 2010 *) Table[2n-1+Floor[(n-4)/5]+Floor[(n-1)/5],{n, 100}] (* Federico Provvedi, Jan 13 2018 *) Quotient[12(Range[100]-1), 5] (* Federico Provvedi, Oct 19 2018 *)
a(n)=([0,1,0,0,0,0; 0,0,1,0,0,0; 0,0,0,1,0,0; 0,0,0,0,1,0; 0,0,0,0,0,1; -1,1,0,0,0,1]^n*[0;2;4;7;9;12])[1,1] \\ for offset 0; Charles R Greathouse IV, Jul 06 2017
vector(100, n, floor(12*(n-1)/5)) \\ G. C. Greubel, Oct 23 2018
Comments