login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A055264 Possible values of A055263; numbers equal to 0, 1, 3 or 6 modulo 9. 2
0, 1, 3, 6, 9, 10, 12, 15, 18, 19, 21, 24, 27, 28, 30, 33, 36, 37, 39, 42, 45, 46, 48, 51, 54, 55, 57, 60, 63, 64, 66, 69, 72, 73, 75, 78, 81, 82, 84, 87, 90, 91, 93, 96, 99, 100, 102, 105, 108, 109, 111, 114, 117, 118, 120, 123, 126, 127, 129, 132, 135, 136, 138, 141 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

The terms are the possible digit sums of a triangular number. - Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jan 09 2002

FORMULA

a(n) =a(n-4)+9 =9*floor[n/4]+[n mod 4]*(1+[n mod 4])/2

G.f.: x(1+2x+3x^2+3x^3)/((1-x)^2(1+x)(1+x^2)). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Sep 30 2008]

CROSSREFS

Cf. A055263.

Sequence in context: A176423 A055632 A133006 * A113502 A061904 A206284

Adjacent sequences:  A055261 A055262 A055263 * A055265 A055266 A055267

KEYWORD

easy,nonn,base

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), May 08 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 11:46 EST 2012. Contains 206011 sequences.