|
| |
| |
|
|
|
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, 494, 505, 516, 527, 538, 549, 560, 571, 582
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
LINKS
| Vincenzo Librandi, Table of n, a(n) for n = 0..10000
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]
Range[10, 1000, 11] (* From Vladimir Joseph Stephan Orlovsky (4vladimir(AT)gmail.com), May 29 2011 *)
|
|
|
PROG
| (Other) sage: [i+10 for i in range(475) if gcd(i, 11) == 11] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 21 2009]
(MAGMA) [11*n+10: n in [0..60]]; // Vincenzo Librandi, Sep 18 2011
|
|
|
CROSSREFS
| Cf. A008593, A017401, A017413.
Sequence in context: A061470 A095778 A065438 * A184989 A072806 A189402
Adjacent sequences: A017506 A017507 A017508 * A017510 A017511 A017512
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
