Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A067991
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A067991 Values of n that produce A068808(n). +0
1
1, 2, 3, 7, 11, 12, 27, 31, 56, 107, 109, 132, 309, 343, 627, 968, 1332, 1891 (list; graph; listen)
OFFSET

1,2

MAPLE

dig := X->convert((convert(X, base, 10)), `+`); T := k->k*(k+1)/2; S := k->seq(dig(T(i)), i=1..k-1); seq(`if`(dig(T(i))>max(S(i)), i, printf("")), i=1..600);

CROSSREFS

Cf. A068808.

Sequence in context: A118203 A064956 A110449 this_sequence A114600 A088905 A045319

Adjacent sequences: A067988 A067989 A067990 this_sequence A067992 A067993 A067994

KEYWORD

nonn

AUTHOR

Francois Jooste (phukraut(AT)hotmail.com), Mar 10 2002

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research