Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A017509
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A017509 11n+10. +0
3
10, 21, 32, 43, 54, 65, 76, 87, 98, 109, 120, 131, 142, 153, 164, 175, 186, 197, 208, 219, 230, 241, 252, 263, 274, 285, 296, 307, 318, 329, 340, 351, 362, 373, 384, 395, 406, 417, 428, 439, 450, 461, 472, 483 (list; graph; listen)
OFFSET

0,1

LINKS

Tanya Khovanova, Recursive Sequences

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 989

MATHEMATICA

f[n_] := FromDigits[IntegerDigits[n^2 + 2n - 1, n + 1]]; Array[f, 54] [From Robert G. Wilson v (rgwv(AT)rgwv.com), Apr 14 2009]

PROGRAM

(Other) sage: [i+10 for i in range(475) if gcd(i, 11) == 11] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 21 2009]

CROSSREFS

Sequence in context: A061470 A095778 A065438 this_sequence A072806 A051942 A082581

Adjacent sequences: A017506 A017507 A017508 this_sequence A017510 A017511 A017512

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research