Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A135989
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A135989 6*n+3+90*floor((6*n+3)/10) +0
1
3, 9, 105, 201, 207, 303, 309, 405, 501, 507, 603, 609, 705, 801, 807, 903, 909, 1005, 1101, 1107, 1203, 1209, 1305, 1401, 1407, 1503, 1509, 1605, 1701, 1707, 1803, 1809, 1905, 2001, 2007, 2103, 2109, 2205, 2301, 2307, 2403, 2409, 2505, 2601, 2607, 2703 (list; graph; listen)
OFFSET

0,1

COMMENT

The sequence gives odd numbers which are divisible by 3.

LINKS

Stefano Maruelli, More information

FORMULA

a(n) = 6*n+3+90*floor((6*n+3)/10); branch b(k)= a(n)+12*k+90*floor((a(n)/100)

EXAMPLE

a(0) = 3, b(0) = a(0), b(1)= 15 b(2) = 27

CROSSREFS

Sequence in context: A078221 A018716 A018725 this_sequence A125652 A018746 A053914

Adjacent sequences: A135986 A135987 A135988 this_sequence A135990 A135991 A135992

KEYWORD

nonn,easy,new

AUTHOR

Stefano Maruelli and Paola Paoloni (robotec(AT)netsurf.it), Mar 02 2008

EXTENSIONS

Edited by Charles R Greathouse IV (charles.greathouse(AT)case.edu), Nov 03 2009

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 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research