Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130202
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130202 Odious triangular numbers. +0
2
1, 21, 28, 55, 91, 171, 253, 276, 351, 406, 465, 496, 595, 666, 820, 861, 1081, 1225, 1378, 1431, 1485, 1540, 1653, 1770, 1891, 2211, 2346, 2485, 2850, 3003, 3160, 3240, 3403, 3655, 3916, 4186, 4371, 4560, 4753, 4950 (list; graph; listen)
OFFSET

0,2

FORMULA

a(n) = A130201(n)/2. Multiplication by 2 preserves odiousness, hence this sequence is odious oblong numbers divided by 2.

MATHEMATICA

Select[Table[n(n + 1)/2, {n, 100}], OddQ[Plus @@ IntegerDigits[ #, 2]] &]

CROSSREFS

Cf. This sequence is the intersection of odious (A000069) and triangular (A000217) numbers.

Adjacent sequences: A130199 A130200 A130201 this_sequence A130203 A130204 A130205

Sequence in context: A120735 A009727 A048012 this_sequence A162692 A048067 A166647

KEYWORD

nonn

AUTHOR

Tanya Khovanova (tanyakh(AT)yahoo.com), May 16 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 8 07:45 EST 2009. Contains 166143 sequences.


AT&T Labs Research