|
| |
|
|
A156638
|
|
Numbers n such that n^2 + 2 == 0 (mod 9).
|
|
3
|
|
|
|
4, 5, 13, 14, 22, 23, 31, 32, 40, 41, 49, 50, 58, 59, 67, 68, 76, 77, 85, 86, 94, 95, 103, 104, 112, 113, 121, 122, 130, 131, 139, 140, 148, 149, 157, 158, 166, 167, 175, 176, 184, 185, 193, 194, 202, 203, 211, 212, 220, 221, 229, 230, 238, 239, 247, 248, 256
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
Contribution from Artur Jasinski, Apr 30 2010: (Start)
Numbers congruent to 4 or 5 mod 9.
Numbers which are not sum of 3 cubes.
Complement to A060464. (End)
Numbers n such that A010888(n^2) = 7. - V.J. Pohjola, Aug 18 2012.
|
|
|
REFERENCES
|
Cohen H. 2007. Number Theory Volume I: Tools and Diophantine Equations. Springer Verlag p. 380. [From Artur Jasinski, Apr 30 2010]
|
|
|
LINKS
|
Vincenzo Librandi, Table of n, a(n) for n = 1..1000
Index to sequences with linear recurrences with constant coefficients, signature (1,1,-1).
|
|
|
FORMULA
|
For n>2, a(n) = a(n-2) + 9.
G.f.: x*(4*x^2 + x + 4)/(x^3 - x^2 - x + 1). - Alexander R. Povolotsky, Feb 15 2009
a(n) = a(n-1)+a(n-2)-a(n-3) = 9n/2-9/4-7*(-1)^n/4. G.f.: x(4+x+4x^2)/((1+x)(1-x)^2). - R. J. Mathar, Feb 19 2009
a(n) = -a(-n+1). - Bruno Berselli, Jan 08 2012
|
|
|
MATHEMATICA
|
a = {}; Do[If[(Mod[n, 9] == 4) || (Mod[n, 9] == 5), AppendTo[a, n]], {n, 1, 300}]; a (*Artur Jasinski*) [From Artur Jasinski, Apr 30 2010]
LinearRecurrence[{1, 1, -1}, {4, 5, 13}, 50] (* Vincenzo Librandi, Mar 01 2012 *)
f[n_] := Total[IntegerDigits[n]]; a = {}; Do[If[Nest[f, n^2, k] == 7, AppendTo[a, n]], {n, 1, 10^5}]; a (* V.J. Pohjola, Aug 18 2012 *)
|
|
|
CROSSREFS
|
Cf. A060464. [From Artur Jasinski, Apr 30 2010]
Sequence in context: A003969 A132140 A102703 * A098868 A087882 A191196
Adjacent sequences: A156635 A156636 A156637 * A156639 A156640 A156641
|
|
|
KEYWORD
|
nonn,easy
|
|
|
AUTHOR
|
Vincenzo Librandi, Feb 12 2009
|
|
|
STATUS
|
approved
|
| |
|
|
